5. a) Briefly explain the working principle of link state routing. Consider the network shown in Figure 1, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance vector/table entries at node V that is shared with its neighbors. How does the scenario change if we use link state algorithm instead of distance-vector algorithm? 7+6 Figure 1: Network for Question 5.a)