Consider the network below, where Distance Vector is used, without poisoned reverse. Assume event 1 happens before event 2: Event 1- the cost of link (x,y) changes from 4 to 30 Event 2 - the cost of link (x,z) changes from 50 to 20 30 50 20 What is the value of Dz(x) before any link cost change (assume the DVs have been propagated to the neighbors, and the algorithm has converged) ? Just write the value. Do not write any text or comment, such as "Dz(x) is ", etc. The automated grader will not recognize your answer as correct if you don't follow that rule. 8. (4 pts) Refer to same network and the same assumptions as in the previous question. Suppose these events happened, in the order listed: 10. (4 pts) Refer to same network and the same assumptions as in the previous question. Suppose these events happened, in the order listed: 1) event 1 (but event 2 has not happened yet) 2) y detects the link cost change and updates its DV. 3) z receives the updated DV from y, and updates its own DV (event 2 has not happened yet) 4) Event 2 happens, z detects the link cost change and updates its own DV After the events happened, Dz(x) = [a], and Dz(y) = [b]. Write only the value. The automated grader will not recognize your answer as correct if you don't follow that rule. 11. (2 pts) Refer to the previous question. After z has updated its own DV, does Z have the correct least cost route to x? Answer yes or no and explain why.