a) Do you agree that a link-state algorithm is more suitable for networks comprised of nodes with high mobility? Justify your answer. (6 marks) b) Determine the shortest path from node E to the rest of the nodes in the network using the Dijkstra's shortest path algorithm. Each link has a link cost as shown in the following diagram: (7 marks) ( 8 10 D E 2 F Show how the algorithm works in a table. c) Determine the shortest path from node E to the rest of the nodes in the network in part (b) using the distance-vector algorithm. Assume that each node initially knows the costs to each of its neighbours. Show the distance table entries at node E. (12 marks)