9. Which statement about the accompanying digraph is true?
This digraph cannot be the order-requirement digraph for a scheduling problem because the digraph has no (directed) edges.
This digraph can be the order-requirement digraph for a scheduling problem.
108
This digraph cannot be the order-requirement digraph for a scheduling problem because it is not allowed for all the tasks to have the same time length.