$1)$ Use Dijkstra$$s shortest path algorithm to compute the shortest path from A to all network nodes. Show work$/$table$.$ Show final next hop routing table$/$forwarding table for A$.$

$2)$ Use Bellman$-$Ford algorithm to show shortest distance from each node to A$.$ Show work$/$table$.$ Show final next hop routing table values for each node to A$.($Assumingthat the algorithm begins with each node knowing only the costs to its immediate neighbors$)$