(Solved): Complete tasks 1,2,3, and 4 using the graph where s is the source node in computer network: 1. From ...

Complete tasks $1,2,3$, and 4 using the graph where $s$ is the source node in computer network: 1. From the graph above, fill out the following table of Diikstra's iterations: 2. Draw the resulting shortest path (trace-back shortest path from source node a to all nodes) 3. Show the resulting forwarding table in $s$ 4. Compute distance vectors (tables) of all nodes after two iteration of bellman ford $(t=0,t=1)$