Given the following network graph, compute the shortest paths from node A based on Dijkstas algorithm/OSPF/Link State. You need to show your work using the provided table, then construct the forwarding table for A.

1) Given the following network graph, compute the shortest paths from node "A" based on Dksta's algorithm/OSPF/Link State. You need to show your work using the provided table, then construct the forwarding table for A. 15 4 D(B), p(BD(C), p(C D(D), p(D)D(E), p(E) 0 1 4 Destination Forwarding node