$2.($a$)$ Use Dijkstra$$s algorithm to find the shortest path from node a to all other nodes in the

network in Fig. $1.$ Show all intermediate steps.

State two properties of Dijkstra$$s algorithm and show how your solution to Dijkstra$$s

algorithm satisfies these properties.