Consider the network shown in the figure below (H) 14 6 F 1 1 4 2 9 3 (B1 2 4 (A) (E) a) Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from A to all destinations and based on this result define the least cost from F to A b) Consider only the part of the network made up by the nodes H, G, and B and ignore all other nodes. Show the first three iterations of the distance- vector algorithm for this three-node network based on the Bellman-Ford Equation. (15 marks) (10 marks)