Minimum Time to Complete Tasks with Dependencies

Problem Statement

Minimum Time to Complete Tasks with Dependencies Problem Description You are given N tasks numbered from 0 to N-1. Each task takes 1 unit of time to complete. Some tasks depend on the completion of other tasks and can only start once all their prerequisite tasks are finished. You are also given a list of dependency pairs where each pair (a, b) means task 'a' must be completed before task 'b' can start. You have unlimited resources and can run multiple tasks in parallel as long as their dependencies are satisfied. Your task is to find the minimum time required to complete all tasks. 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 firs