i nedd help with part a, b& c please

Consider the network shown below where the number on a link between two nedes is the distance between them. 2 2 Div Cost of the path from cenode te destination P: Previous node (neighbor of) along the current least.cout path from the source to N set of nodes whose least cost path from the source is known (a) (12 pts) Le Dijkstra's shortest path algorithm to find the shortest path from to all other network medes Show how the algorithm works by completing the following table. Ouah ECSISZA/ERCITIA Stop 0 N D/B).p/B DOMO DD.PD DERE DE 1.4 1 2 ho 4 5 {b) (pes) What are the resulting shortest paths spanning tree and the routing table at node A! Druw the spring in Complete the sale Destacthap 3 C D E F (c) (5 points) Lost all links that do not affect the shortest path from A 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 ( 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 4 D(B), p(B) D(C), p(C) D(D), PD D(E), P(E) D(F), p(F) 1, A 1 2 3 5 (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