Problem Statement

You are managing a software project with N modules numbered from 0 to N-1. Each module requires exactly 1 day to develop. Certain modules have dependencies on other modules and cannot begin development until their prerequisite modules are completed. You are provided with a list of dependency relationships, where each relationship (x, y) indicates that module x must be fully developed before module y can begin. Your development team has unlimited developers available, allowing multiple independent modules to be developed simultaneously, provided their dependencies are met. Determine the minimum number of days required to complete the entire project. Function Description Implement the function minimumTimeToCompleteTasks which accepts the total number of modules and their dependency relationships, then calculates the minimum days needed to finish all modules. Parameters N: An integer denoting the total count of modules in the project. M: An integer representing the number of dependency re