Consider the weighted graph in the demo for Dijsktra's algorithm image below. Perform the algorithm to nd smallest weight paths from vertex g to every other vertex in that graph. Do only five iterations of the algorithm, i.e., stop after exploring from five different vertices, including g; indicate the queue, the weights, the parents of the vertices, and the edge to be added to the rooted tree after each iteration of the algorithm. Draw the resulting partial spanning tree representing minimum weight paths from vertex g. Do not continue the algorithm further.