Consider the network in the figure. Use distance vector algorithm to calculate and fill in the distance-vector table for node x by answering the three questions (you may refer to the second question in homework 3). 1. (1 point) Fill in the initial routing table for node x. 2. (3 points) After initialization, node y and node z send its distance vector to its neighbor node x, respectively. After receiving the updates, node x re-computes its own distance vector. Fill in the routing table for node x at this iteration. 3 (3 points) Referring to your answers from the second question, fill in the next-hop when the packet is transmitted from node x to the different destination node as shown in the following table. Destination Next Hop y z w