Question 2 1 pt Suppose you have the following project digraph. (The numbers in parenthesis represent hours.) A(6) a D(3) G(2) START(O) B(4) END(O) E(6) C(8 F (4) Consider the following schedule using two processors. Time: 0 2 4 6 8 10 12 14 16 18 20 D! G IE This schedule is an illegal schedule. This is the schedule one gets using the decreasing time algorithm. This schedule is an optimal schedule. This is the schedule one gets using the critical path algorithm. None of the above