Given the following adjacency lists $($with edge weights in parentheses$)$ for a directed

graph:

A: B$(2),$ C$(7),$ D$(6)$

B: C$(3),$ F$(1)$

C: E$(3)$

D: E$(3)$

E: F$(1)$

F: C$(3),$ D$(1)$

Execute Dijkstra$$s shortest$-$path algorithm by hand on this graph, showing how the data

structures evolve, with A as the starting vertex. Clearly indicate which edges become part of

the shortest path tree and in which order.