Order Tasks with Dependencies Using a Deterministic Topological Sort

You are given numTasks tasks numbered from 0 to numTasks - 1, along with a list dependencies of ordering requirements. Each element is a pair [task, prerequisite], meaning that prerequisite must be completed before task may start. Return a list that includes every task ID from 0 to numTasks - 1 exactly once, arranged so that every task appears after all of its prerequisites. If several valid arrangements exist, return the lexicographically smallest one. Compare two…