Solve the following $8-$sliding tile puzzle using the textbook code's implementation of $A^{**}$ search $($the go

state is the tiles all in sorted order with the blank at bottom right$).$

Hint: you can modify the following main code to solve the puzzle:

from search import $*$

eight$\_$puzzle $=$ EightPuzzle$(??)$ # change this

if $==\text{'}-\_$ :

print$($astar$\_$search$($eight$\_$puzzle, h$=$None, display$=$True$).$solution$())$

exit$()$

The number of actions to solve this puzzle is

$($enter an integer, e$.$g$.,10).$

The first few actions to solve this puzzle are $($enter one of UP$,$ DOWN, LEFT, RIGHT; check your

spelling.$)$:

UP

UP