Question 1 [10 points total] For the following graph, show the execution of Dijkstras algorithm with source node E. That is, state which nodes get added to the single-source shortest paths tree in order, and state which edges make up this tree.

You may illustrate your solution either by tracing out the execution on the graph per step and showing how the distance values are updated. Alternatively, you can illustrate the growth of the set T (from the pseudocode in lecture) in order, and make it clear how the distance values are being updated. In either case, be sure to show your work so that you dont lose points.

NOTE: There is a tie in this example where you need to choose between two lowest weighted nodes. This can happen in practice! In this case, give priority in terms of alphabetical order; that is B comes before C comes before D etc.

F C D 1 6 4 1 2 A