An order-requirement digraph for a scheduling problem, which will utilize four processors, is shown below. 

1) Find the critical path. 

2) Find the earliest completion time. 

3) Find the priority list that would be used to schedule these tasks if the critical-path algorithm were to be used. 

You do NOT need to actually complete the schedule.