Question $2$

Given the initial state and the goal state of the following five$-$puzzle problem

$\backslash$table$[[,2],[1,3],[5,4]]$

$($a$)$

$\backslash$table$[[1,2],[3,4],[5,]]$

$($b$)$

Five$-$puzzle problem: $($a$)$ initial state; $($b$)$ goal state

a$.$ Using the tree, find the goal state by conducting:

a blind breadth$-$first search strategy.

a depth$-$first search strategy

iterative deepening search with initial $k=0$ and incremented by $1$

Greedy search with $h(n)=$ the number of misplaced tiles.

A$*$ search with $f(n)=g(n)+h(n)$;$g(n)$ is the tree level and $h(n)$ is the number of misplaced tiles.