Q$3.(20$ pts$)$ Apply Dijkstra's algorithm to the following graph, and for each iteration, determine $1)$ which vertex is newly discovered to have the shortest distance from vertex $a,2)$ what the shortest distance to that vertex is$,$ and $3)$ what the shortest path to that vertex is$.$

Iteration $1$: