Part VI: Solve the following problems: (out of 20): [ 10 points each ] 1. Consider the following network that consists of six nodes A, B, C, D, E, and F. The connection weights are given on the respective edges. The network is running LS broadcast algorithm and is accomplished by OSPF. Answer the following: B 3 3 10 A C E F 2 2 4 3 D i. Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from E to all destination. Step N' D(A), p(A) D(B), p(B) D(C), p(C) D(D), p(D) D(F), p(F) 1 N 3 4 5 ii. Redraw the graph model for this network to show the resulting least-cost paths and forwarding in the node E