15:36 PENdugwa to you 6s X Page view | A Read aloud | (T) Add text | Draw 4068CEM/Resit/5 (a) Use Dijkstra's algorithm to find the shortest path from node A to node B in the following network and give its length. 2 26 5 6 2 3 8 (6 marks) (b) Use Kruskal's algorithm to find a minimal spanning tree for the following graph, explaining each step. Draw the minimal spanning tree. Give the total weight of the minimal spanning tree. 19 (6 marks) (question 4 total: 12 marks) F7 F8 F9 F10 F11 F12 PrtSc Pause Mx O Send message