please explain step by step.

5.1 For the network shown in Figure 5.34 a. Use Dijkstra's algorithm to obtain the shortest paths from node A to all b. Use the shortest backwards path tree algorithm to obtain the shortest other nodes. paths from all nodes to node A 7 10 16 3 10 5 5 12 4 10 Assume that the network in problem 5.1 above has been using the internodal distance exchange distributed routing procedure for a long time and that the costs have not changed during that time. 5.2 Show the distance-routing table entries at all nodes (except A) that indicate paths to destination A. a. b. Assume that the A to B and the B to A links fail simultaneously Show the operation of the algorithm including all the messages transmitted