Question II- Routing Algorithms (50 points) Consider the network topology shown below: R1 1 4 R3 R2 2 5 5 5 R7 3 13 R4 3 1 3 10 Y R6 11 5 R5 R8 20 11 2 R9 1. [20 Points] Show the operation of Dijkstra's algorithm for computing the least cost path from Rl to all destinations. (Fill a table the same as in the lecture). 2. [10 Points] Using question 1, construct the shortest path tree by tracing predecessor nodes. [Justify and Show all your work] 3. [20 Points] Using the solution of question 1: a. Find the lowest cost and shortest path from Router R1 to R5 [Justify and Show all your work] b. Find the lowest cost and shortest path from Router R1 to R9 [Justify and Show all your work