Problem # 6 (12 points): Consider the following network. Suppose that the link cost c(0,2) has changed from 8 to 1, re-compute the distance tables for nodes 0, 1, 2, and 3 after only one iteration of a synchronous version of the distance vector algorithm. Note that the current tables' values prior to the link cost change are as shown in the leftmost column of the tables. cost to cost to cost to D1012 3 cost to D1012 3 cost to D201 2 3 cost to D2012 3 cost to cost to D3012 3