Question 2 - A-Level Maths

Set up a dynamic programming tabulation to find the maximum weight route from ( \(0 ; 0\) ) to ( \(3 ; 0\) ) on the following directed network.
\includegraphics[max width=\textwidth, alt={}, center]{bfdc0280-9979-4bbe-81ba-9b1c36ff8374-3_595_1054_404_587} Give the route and its total weight.
The actions now represent the activities in a project and the weights represent their durations. This information is shown in the table below.
Activity Duration Immediate predecessors
\(A\) 8 -
\(B\) 9 -
C 7 -
D 5 \(A\)
E 6 \(A\)
\(F\) 4 \(B\)
\(G\) 5 B
\(H\) 6 \(B\)
\(I\) 10 C
\(J\) 9 \(C\)
\(K\) 6 \(C\)
\(L\) 7 D, F, I
\(M\) 6 \(E , G , J\)
\(N\) 8 \(H\), \(K\)
Make a large copy of the network with the activities \(A\) to \(N\) labelled appropriately. Carry out a forward pass to find the early event times and a backward pass to find the late event times. Find the minimum completion time for the project and list the critical activities.
Compare the solutions to parts (i) and (ii).