i need part a and c answers

4. (25 points) Link State Routing Consider the network shown below where the number on a link between two nodes is the distance between them. 2 ( 1 2 3 7 A F 2 2 1 2 D(v): Cost of the path from source node to destination v P(1): Previous node (neighbor of v) along the current least-cost path from the source to v N: set of nodes whose least-cost path from the source is known. I (a) (12 pts.) Use Dijkstra's shortest path algorithm to find the shortest path from A to all other network nodes. Show how the algorithm works by completing the following table. Step 0 N A D(B), p(B) D(C), pC) D(D), p(D) D(E), p(E) D(F). p(F) 1, A 1 NO 2 3 us (b) (8 pts.) What are the resulting shortest paths spanning tree and the routing table at node A? Draw the spanning tree. Complete the table Dest Nexthop B I D E F (c) (5 points) List all links that do not affect the shortest path from A