Question 5 1 pts Suppose you have the following project digraph. (The numbers in parenthesis represent hours.) STARTIIO) 0 . 800(0) Consider the following schedule using three processors: Time: 0 2 4 6 8101214161820 Which of the following is true? This schedule is not an optimal schedule because the project can be scheduled with a completion time of 11 hours. This schedule is an illegal schedule because task E was started before task C was completed. 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. None of the above