Q1 Consider the following graph representing a network with a, b, c, d, e and z routers andthe metric is the distance. Image attached based on the attached image please show execution of Dijkastra’s...

Q1 Consider the following graph representing a network with a, b, c, d, e and z routers and
the metric is the distance.

Image attached

based on the attached image please show execution of Dijkastra’s algorithm to find the shortest path from router a to all other routers.

Thank you in advance!

Extracted text: 2 a 3 1 Show execution of Dijkastra's algorithm to find the shortest path from router a to all other routers. 2.