2 A network is shown below.
\includegraphics[max width=\textwidth, alt={}, center]{c9fb5dad-1069-46cd-b167-80b77016f03c-2_533_869_1160_244}
- Use an appropriate algorithm to find the least weight (shortest) path from A to D.
- Use Kruskal's algorithm to find a minimum spanning tree for the network.