1. (50pts) (a) Find the shortest path from B to D in the following graph using Bellman Ford's routing algorithm. Show your steps by using the Bellman-Ford formulas. (b) Show how route tables change at each router B and D when there is an update from the neighbors. 5 2 3 6 2 Figure 1: Network of routers. 2. (50pts) Now compute the shorthet path from B to E using Dijkstra's algorithm in the same graph. Show all your steps