The figure below shows a simple network. Using the Bellman-Ford algorithm, generate shortest path routes from node A to all other nodes. The solution for node A is given below. The actual shortest route (from which you can then look at the next hop) is shown with a darkened number. Solve the network routing for node D using the distance vector algorithm (Bellman-Ford). Show all the intermediate steps and fill the distance vector matrix for node D below..