Use the Following Digraph to Answer Questions
Suppose That $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$

Multiple Choice

Use the following digraph to answer Questions
Suppose that a crew can currently complete a job (order-requirement digraph is shown below) in a minimum amount of time.
-Apply the critical-path scheduling algorithm to obtain a priority list.

A) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$
B) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 6 } , T _ { 5 } , T _ { 3 }$
C) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 6 } , T _ { 3 }$
D) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$