$6.)A^{**}$ Search $(A^{**}).$ When expanding, expand from left to right $($i$.$e$.,$ if a child has two nodes, add

the one on the left to the fringe first$).$ Although you will need to use a priority queue and set $($to

keep track of visited states$),$ you do not need to draw them here for points$/$correctness$,$ but

you may want to draw them on scrap paper below to help.

How many nodes were expanded $($i$.$e$.,$ how many iterations did it take?

What was the path computed by this search strategy?

Was the computed path optimal?