Quiz: Parallel Scheduling

In the Parallel Courses III problem, you compute finish[v] = time[v] + max(finish[u]) over all prerequisites $u$ of $v$. If a node has no prerequisites, what is its finish time?

1. A.$0$, because there is nothing before it
2. B.Its own time[v], because it starts immediately
3. C.The minimum time across all nodes
4. D.Undefined, because every node needs a prerequisite