Given the following graph, please answer the following two questions. Always assume that the vertex, A, is the source node. 0 5 E A 2 2 B D F 3 G H 8 (1a) (7 points) Please list the order that nodes are removed from the priority queue if using Dijkstra's algorithm to find all shortest paths from the source node, A. A has been provided for you, as it's the first node that will be removed from the priority queue. Assume that ties are broken alphabetically (so, if E and F were tied in terms of priority, E would be given more priority than F). Solution: A, (1b) (6 points) List the shortest path cost associated with each node in the graph. D(A) = 0 has been provided, as the source node always has a shortest path cost of 0. D(A) = 0 D(B) = D(C)= D(D) = D(E) = D(F)= D(G)= D(H) =