For the shown network below, show the details of the first two steps $($i$.$e$.,$ first two iterations$)$

in the progression of the distances and next hops each node computes to the others using distance

vector routing. Start from the left tables and continue the process to the right ones. Show your

computations. Important: To save some time, you are allowed to make shortcuts and you

don't have to show all the details of the computations. You can apply common sense when

possible. For example: $1)$ if the distance is $1,$ you can assume it will remain the same without

doing any computations. $2)$ You don't need to use any formula to calculate the cost of a direct

link. $3)$ The shortest path $($and cost$)$ from any node $y$ to any node $z$ is the same as the shortest

path from node $z$ to node $y.$