Consider the project digraph shown in Fig. $3.$

a$)$ Use the backflow algorithm to find the critical time for each vertex. $($Write the critical times for each vertex in square brackets next to the processing times.$)$

b$)$ Schedule the project with $N=2$ processors using the critical$-$path algorithm. Show the timeline for the project, and give the project finishing time.

Fig. $3$