Distance Vector Routing:
Using Bellman Ford algorithm and according to the edges ordermentioned on the graph. Find the optimal paths starting at node1:
#2 #1 #7 #3 #5 4 #4 #8 #6 Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .