2. (20 pts) The routers in the following network are running the distance vector (distributed Bellman- Ford) algorithm without poisoned reverse, and they are all initiated simultaneously. Fill in the following distance table at node 1 after initialization (iteration O) and after iterations 1, 2, 3 and 4. Copy the table below into your answer sheet and fill in. 1 2 3 1 1 5 Iteration 2 0 1 3 Distance to Node 2 3 4 5 6