Suppose you have the following project digraph. ( he numbers in parenthesis represent hours.) D(3) G(2) START(O)O END (O) E(6) C(8) F (4) Consider the following schedule using three processors: Time 0 2 6 8 10 12 14 16 18 20 Which of the following best describes the situation? This schedule is an illegal schedule because task E was started before task C was completed. None of the above This schedule is not an optimal schedule because the project can be scheduled with a completion time of 11 hours. This schedule is an optimal schedule for three processors. This schedule is an illegal schedule because task F was started before task E was completed