3. (a) A network is described in Fig. 1. Use Dijkstra's algorithm to find the shortest path from node A to all other nodes in the network. Show all intermediate steps. Select nodes according to their lowest alphabetical order when two route costs are tied. State two properties of Dijkstra's algorithm and show how your solution to Dijkstra's algorithm satisfies these properties. 10 Figure 1: Dijkstra's Algorithm Network