(b) Consider the following graph: 3 4 2 ch 5 Demonstrate the execution of the Jarnik-Prim algorithm for finding the minimal spanning tree on this graph by writing out a table of the execution steps in the fol- lowing format where the first row, following initialisation, is already provided (initial node to add is node A): E 0.A Finished B D 20. B C D O, E Each row should show the results of one iteration of the algorithm after a node is added to the spanning tree, where the Finished column identifies the node that is finished in that iteration, and the remaining columns show the current distance of the node of that column from the tree, the node that connects it to the tree and a tick mark if the node of the column is finished. [10 marks) 5