SOLVED: 2. Given the 4-node topology shown below with the indicated link costs, compute thedistance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algorithm (as in Figure 5.6)103. Given the 4-node topology in Problem #2, do the following:(a) Give a link-cost change for either c(w, x) or c(w,Y) such that w will inform its neighbors of a new minimum-cost path to 2 as a result of 'executing the distance-vector algorithm: (6) Give a link