Can someone explain the pseudocode.and what is happeing with the contents of the queue?

Dijkstra's with Priority Queue S(s), d(s)0, d(u)+oo; QinsertAl(V) while Q do 10 u* Q.eztract Min() ; foreach v E N() do if d(v) > d)w(", v) then d(v)d(u)w,) Q.update(v); end end end Show the content (in the formofnode, key-value> pairs) of the priority queue after each of the first three iterations of the while loop when the algorithm is applied to the given instance