Suppose you have the following project digraph. $($The numbers in parenthesis represent hours.$)$

Consider the following schedule using three processors:

$\backslash$table$[[,,,$Time,$],[,,5,10,15,20],[P_1,,,,$G$,],[P_2,B,,,$D$,],[P_3,,$C$,,F,]]$

Which of the following best describes the situation?

None of the above

This is the schedule one gets using the decreasing time algorithm.

This schedule is an illegal schedule.

This schedule is an optimal schedule.

This schedule is not optimal, because it is possible to complete the project in $20$ hours.

Suppose you have the following project digraph. $($The numbers in parenthesis represent hours.$)$

Consider the following schedule using three processors:

$\backslash$table$[[,,,$Time,$],[,,5,10,15,20],[P_1,,,,$G$,],[P_2,B,,,$D$,],[P_3,,$C$,,F,]]$

Which of the following best describes the situation?

None of the above

This is the schedule one gets using the decreasing time algorithm.

This schedule is an illegal schedule.

This schedule is an optimal schedule.

This schedule is not optimal, because it is possible to complete the project in $20$ hours.