4. Consider the graph I in Figure 1. 1. Illustrate Dijkstra's algorithm on the graph I by finding shortest paths to all destinations starting from vertex A. In addition show how parent Of and distance To arrays change through- out the execution of the algorithm. It suffices to only show the state of parent Of and distance To every time the processing of a vertex is finished [15 marks] 2. Draw the resulting shortest paths tree. [5] marks A B 2 3 2 2 E 3 F 4 4 Figure 1: The graph I from question 3. 2