6. Consider a network with seven routers, A, B, C, D, E, F, and G. After reliable flooding, router F obtains the link-state information as shown in Table 1. Table 1: Link-state information at F. Router | Directly connected neighbors and costs (B, 2); (C, 4); (F,7) (A, 2); (C,3); (D,3) (A, 4); (B, 3); (D, 4); (E,3); (F, 8) (B, 3); (C, 4); (E,6) (C,3); (D,6); (F,6); (G,8) (A, 7); (C, 8); (E,6); (G, 12) (E,8); (F, 12) MORE Show the operation of Dijkstra's algorithm for computing the least cost path from node F to all the destinations (you would have to show all the steps of which node is added at each iteration). Provide the shortest-path trees from F and the routing table at F