Z number to be used is 23345735

Run Dijkstra's algorithm on the graph G below, where s is the source vertex. Draw a table that shows the vertices in Q at each iteration. write the d and ? values of each vertex. Darken the edges in the shortest-path tree. List the order in which vertices are added to S. Use the algorithm learned in class. Use your Z number z1 22232452622 to find the weights of the edges in the graph. If any digit in your Z number is equal to zero, then substitute it by 6. Z5 73 Z6 Z1 For example if your Z number is 12345678, then the graph becomes: 4