Hi Guys, I need help with those 2 questions First question Consider the link state routing. The following link state packets are transmitted by the routers in the network: From A: [B,2; D,1] From B: [A,2; C,3; F rom C: [B,3; D,3; From D: [A,1; B,2; From E: [C,1; D,1] // distance between A and B is 2 and between A and D is 1 D,2] E,1] C,3; E,1] a) Use the link state packets to construct the network's topology. ? b) Use Dijkstra's algorithm to find the shortest path from C to each of all other ?routers. Label the vertices with (prev, dist) when the algorithm terminates. You only ?need to show the result. You are not required to show the intermediate steps. ? c) Show the updated routing table for router C. ? Second question Consider the distance vector routing. The direct distances from router C to its neighbor routers A, B, and D are 1, 8, and 2, respectively. C receives the following vectors from A, B, and D (represented horizontally instead of vertically ):