Can someone please answer part c and d only thanks!

4. (60 Points) Routing Algorithms The following figure shows a network with 2 hosts (Hi and H2), 5 routers (A, B, C, D, E) HI H2 There are 10 bi-directional links, labeled from 1 to 10, with their transmission bandwidth and propagation delay as follows: Link # | Trans. BW (100 kb/s) Propagation delay (ms) 30 20 10 20 40 0.5 0.5 20 10 Packets are sent in the network in a stored-and-forward manner. Suppose that the network is initially empty and processing delay is negligible, i.e., the only delays relevant here are packet transmission time and propagation delay. Now H1 wants to send a packet of 2000 bits to H2 (a) (25 Points) Use Dijkstra's algorithm to determine the route the packet should take in order to achieve minimal delay. Show your work on Figure 3. (b) (5 Points) Is this route the same as the route with the minimum number of hops? (c) (20 Points) Now suppose that the network employs a distributed but synchronous version of the Bellman-Ford routing algorithm (to find the path of minimum delay for each 2000bits packet). Fill in Figure 4 to show the exchanges of routing tables until the final result. (You may ignore the entries for hosts Hi and H2, and focus only on the routers.) In each router's table, the routers in parenthesis are its neighbors. (d) (10 Points) Now assume that links AB and BE fail. Run Bellman-Ford algorithm, starting from the steady state achieved in question (c) above. Show your calculations similarly to (or on a copy of) Fig. 4. Does the algorithm converge