(a). Apply Dijkstra's Algorithm to find the shortest path G=(V, E) from the vertex (s) to vertex (t) in Figure 2. Draw step by step the process of the Dijkstra's algorithm. [9 marks] 24 O 9 9 18 14 08 2 30 19 11 018 15 5 20 16 distance label 8 Figure 2. Directed Weighted Graph-1