Problem Statement

You're overseeing a software project made up of N modules, numbered 0 through N-1, where each module takes exactly 1 day to build. Some modules depend on others and can't start until their prerequisites are finished. You're given a list of dependency pairs, where each pair (x, y) means module x must be fully built before module y is allowed to start. Your team has as many developers as needed, so any number of modules whose dependencies are already satisfied can be built in parallel on the same day. Work out the fewest days needed to finish the whole project. Function Description Implement minimumTimeToCompleteTasks, which takes the module count and the dependency pairs, and works out the minimum number of days to finish every module. Parameters N: An integer denoting the total count of modules in the project. M: An integer representing the number of dependency relationships. dependencies: A collection of relationships (x, y) where module x is a prerequisite for module y. Return Value