Problem Statement

Minimum Time to Complete Tasks with Dependencies Problem Description There are N tasks, numbered 0 through N-1, and each one takes exactly 1 unit of time to finish. Certain tasks cannot begin until other tasks are done - you are given a list of ordered pairs (a, b) meaning task 'a' must finish before task 'b' is allowed to start. Resources are unlimited, so any number of unblocked tasks may run at the same time. Work out the least amount of time needed for every task to finish. Implement the function minimumTimeToCompleteTasks which takes the number of tasks N and a list of dependency pairs, and returns the minimum time required to finish all tasks. Parameters: N: An integer representing the total number of tasks. M: The number of dependency pairs. dependencies: A list of pairs (a, b) representing dependencies, where task 'a' must be completed before task 'b'. Input Format The first line contains a single integer N, the number of tasks. The second line contains a single integer M, the