Consider the network with the indicated link costs as shown in Figure 1. i k k Figure 1 i denote the third last digit of your student ID. If the digit is "0", it is replaced with "10". j denote the second last digit of your student ID. If the digit is "0", it is replaced with "10". k denote the last digit of your student ID. If the digit is "0", it is replaced with "10". Example 1: Student ID is DMT2109234. i has the link cost 2. j has the link cost 3. k has the link cost 4. Example 2: Student ID is SWE2109100. i has the link cost 1. j has the link cost 10. k has the link cost 10. a) Show this network diagram with the actual link cost of i, j, and k for this question. b) Show the routing table at each node after the initialisation step and after each iteration of a synchronous version of the distance-vector algorithm. Your routing table should contain the entries including destination, cost and next hop. c) Assume that the link between node d and e is now disconnected. Identify the potential issue with the process of the distance vector computation. You should justify your answer based on the link cost in your network diagram.