(1) A ring network shown below uses a distance vector routing scheme where routing tables will be exchanged at t1, 2, 3... .sec. Assume that the link metric is hop count and that the amount of time for exchanging and processing the routing tables is 0. Att 0, each routing table only contains the information of its neighbors. (a) What is the routing table of node b at t-0, (b) at t = 1.5 sec. (1) A ring network shown below uses a distance vector routing scheme where routing tables will be exchanged at t1, 2, 3... .sec. Assume that the link metric is hop count and that the amount of time for exchanging and processing the routing tables is 0. Att 0, each routing table only contains the information of its neighbors. (a) What is the routing table of node b at t-0, (b) at t = 1.5 sec