Q1: (7.5 Marks Consider a computer network want to send data packets from router to destination router z. The time to go from router a to b is 3 ms, from a to c is 4ms, from router b to e is 5ms, from b to d is 6 ms, d to z is 7 ms, d to e is 2 ms, c to e is 6 ms, e to z is 12 ms. Find the shortest path from city a to z through which minimum time of travel is obtained using Dijkstra algorithm. Draw the routing table and all the graphs during the procedure