$(8$ pts$.)$ Run Dijkstra's algorithm on the following graph, starting at node $x.$ Whenever there is a choice of vertices with the same dist value, always pick the one that is alphabetically first. Please draw a table where each row shows the dist array at each iteration of the algorithm.