Attached is image of the problem. Make sure to answer all parts of the problem correctly. Consider the network topology below and work on the following problems.[Image of a network graph with nodes A, B, C, D, E, F, Z]**Figure 1: Weighted graph representation of a network of routers.**A. Using Dijkstra's algorithm, calculate the shortest path from node A to any other node in the topology. Show your work in the table below.| Step | N' | D(B), p(B) | D(C), p(C) | D(D), p(D) | D(E), p(E) | D(F), p(F) | D(Z), p(Z) ||------|----|------------|------------|------------|------------|------------|-----------|| 0 | A | | | | | | || 1 | | | | | | | || 2 | | | | | | | || 3 | | | | | | | || 4 | | | | | | | || 5 | | | | | | | |**Figure 2: Fill out the above table as you calculate the shortest path for the topology in Figure 1.**B. Which is the correct illustration of the shortest path (pick one of the options in Figure 3).Options with different paths are shown labeled A, B, C, and D, each highlighting different connections in Figure 1.**Figure 3: Select the correct shortest path for the topology in Figure 1.**C. Which is the correct forwarding table for node A following the shortest path calculations?1. | Destination | Link | |-------------|------| | B | (A, B) | | C | (A, C) | | D | (A, C) | | E | (A, E) | | F | (A, E) | | Z | (A, C) |2. | Destination | Link | |-------------|------| | B | (A, C) | | C | (A, E) | | D | (A, C) | | E | (A

This comprehensive approach to solving the network routing problem highlights the efficiency of Dijkstra's algorithm in determining the optimal paths through a weighted graph, which in practical scenarios, like computer networks, can determine the best routes for data packets to traverse a network.With the corrected distances:StepND(B)P(B)D(C)P(C)D(D)P(D)D(E)P(E)D(Z)P(Z)0A4A2A1C3C2A10C12C2B3C2A8B12C3D3C2A8B10D14D4E3C2A8B10D14D5Z3C2A8B10D14DEXPLANATIONThe distance from A to C is 2.The distance from A to B via C is 3 (2 from A to C, and 1 from C to B).The distance from A to D via B is 8 (3 from A to B, and 5 from B to D).The distance from A to E via D is 10 (8 from A to D, and 2 from D to E).The distance from A to Z via D is 14 (8 from A to D, and 6 from D to Z).Now, you can select the appropriate illustration and forwarding table based on these corrected distances. The illustration should match the highlighted paths with the corrected weights, and the forwarding table should reflect the correct next hop for each destination based on the shortest paths calculated.The distance from A to C is 2.The distance from A to B via C is 3 (2 from A to C, and 1 from C to B).The distance from A to D via B is 8 (3 from A to B, and 5 from B to D).The distance from A to E via D is 10 (8 from A to D, and 2 from D to E).The distance from A to Z via D is 14 (8 from A to D, and 6 from D to Z).Now, you can select the appropriate illustration and forwarding table based on these corrected distances. The illustration should match the highlighted paths with the corrected weights, and the forwarding table should reflect the correct next hop for each destination based on the shortest paths calculated.Which is distance is 14 from A to Z via D where 8 from A to D and 6 from D to E(C).AnswerA to C with a distance of 2.C to B with a distance of 1, making the total distance from A to B equal to 3.B to D with a distance of 5, making the total distance from A to D equal to 8.D to Z with a distance of 6, making the total distance from A to Z equal to 14.A to C with a distance of 2.C to B with a distance of 1, making the total distance from A to B equal to 3.B to D with a distance of 5, making the total distance from A to D equal to 8.D to Z with a distance of 6, making the total distance from A to Z equal to 14.You would need to compare this with the illustrations provided in Figure 3 and select the one that accurately represents these paths and distances.Step: 3Based on the shortest paths to each node from A, the forwarding table for node A should specify the next hop for traffic destined to each node. Here's the explanation:This table shows the next hop from node A to reach each of the other nodes in the network. For all destinations, the next hop is to node C, which is in line with the shortest paths derived from the algorithm:EXPLANATIONTo get to B, we go through C.To get to C, we go directly to C.To get to D, even though the path is A-C-B-D, the next immediate hop from A is to C.To get to E, the path is A-C-B-D-E, and again, the next hop from A is to C.To get to Z, the path is A-C-B-D-Z, so the next hop from A remains C.To get to B, we go through C.To get to C, we go directly to C.To get to D, even though the path is A-C-B-D, the next immediate hop from A is to C.To get to E, the path is A-C-B-D-E, and again, the next hop from A is to C.To get to Z, the path is A-C-B-D-Z, so the next hop from A remains C.This forwarding table is constructed from the perspective of node A and only considers the immediate next hop for the shortest path to each destination node.DestinationLinkB(A,C)C(A,C)D(A,C)E(A,C)Z(A,C)