11. An order-requirement digraph has exactly two vertices that have no edges coming into them. Explain why, if there are three processors available, one or more of these processors must be idle some of the time.
11.
The two vertices with no incoming edges correspond to the only tasks that are ready at time 0. These tasks are assigned to different processors at time 0, forcing the third processor to be idle for some period of time.