Please make a table iterating through the graph and provide steps for my understanding. Do not re-post old/similar answers + don't just copy-paste answer from chatGPT. Thanks!

Problem One: Algorithm Tracing In Blackboard, show the result of each iteration of applying Dijkstra's Shortest-Path Algorithm to the following graph, starting at node #1 : At each iteration, if a node has not yet been seen, then put an ? in the box for that node. After a node has been chosen, put an x in the box for the node. If there is a tie at a particular iteration, then pick the node having the lowest node number. (14 points.)