Problem 12 (14 points) Consider the simple network in Figure 5 below, X, Y and Z are switches and link cost as specified. Assume Distance Vector algorithm is used and have converged. Now Y's and Z's Routing table will look like Table. 2. (a) Now Let assume the cost of link X-Y suddenly changed to 100. Please write down the Y's and Z's routing table regarding distance to X, after Y updates this information to Z and then Z updates its information back. [4pts] b) Please write down the Y's and Z's routing table regarding X after Y updates this information to Z again and then Z updates back again. [4pts] c) How many updates did Y get until its distance to X have converged with Distance Vector algorithm? [5pts] 4 50 Figure. 5 Node Y/Distance Via X Via Z Node Z/Distance Via X 50 Table. 2 Via Y Problem 12 (14 points) Consider the simple network in Figure 5 below, X, Y and Z are switches and link cost as specified. Assume Distance Vector algorithm is used and have converged. Now Y's and Z's Routing table will look like Table. 2. (a) Now Let assume the cost of link X-Y suddenly changed to 100. Please write down the Y's and Z's routing table regarding distance to X, after Y updates this information to Z and then Z updates its information back. [4pts] b) Please write down the Y's and Z's routing table regarding X after Y updates this information to Z again and then Z updates back again. [4pts] c) How many updates did Y get until its distance to X have converged with Distance Vector algorithm? [5pts] 4 50 Figure. 5 Node Y/Distance Via X Via Z Node Z/Distance Via X 50 Table. 2 Via Y