Consider the initial and the goal state given below.

There are $9$ blocks, out of which any one remains

empty, four are occupied with $*$ and four are

occupied with $+.$ You can move only one symbol at

a time to the empty block. Horizontal and vertical

movements of the symbols are allowed but diagonal

movements of the symbols are not allowed.

i$.$ Construct the search tree for the given problem

considering initial state as root node of the tree.

ii$.$ Apply DFS to find out the path from initial state

to goal state.