UNIFORM COST SEARCH USING PRIORITY QUEUE WITH COST AS PRIORITY.

Suppose uniform-cost search, as implemented below, is applied the state-action graph shown in Fig. 1 to find the optimal path from the initial state to the goal state. Fill out the frontier priority queue and explored set at the start of each iteration (i.e., at line 4 of the psuedocode) Use the path cost from initial state to a frontier node as its priority (lower cost is higher priority). Pop off the queue in priority order. When more than one node in the frontier has the same priority, use FIFO to determine the pop order. [4 pts, one for each iteration that is correct assuming the previous was correct.] I: exploredempty set 2: frontier