Z 9 18 3 1. Show the tracing of executing Dijkstra's single-source shortest paths algorithm given below on the undirected graph given below. Dijkstra(G, s) { Initialize Q of V with (v) oo for each node v in V. sr{}, r(s) + 0. 21 while (Q is not empty) 25 v = Extract Min(Q). Add v to S. 12 for each edge e=(v, w) such that we s{ if (n(v) + le