Use the critical path algorithm to create a priority list for the digraph below, then schedule the project with two processors.

Task $7$ is done by $$ starting at time

Task $8$ is done by Processor $22$ starting at time

$$ e $$

The finishing time for the schedule is $$