$1.$ Implement A$*$ search solutions considering the Misplaced, Euclidean, and Manhattan heuristics to the problem.

a$.$ Explain your representation.

$2.$ Run your program for $3<=$ n $<=6.$

a$.$ For each n$,$ repeat the run $10$ times with different random Initial State. Final State should be the standard sorted one.

b$.$ Report the Initial State, Final State, and the Solution Sequence of Actions.

c$.$ Across the $10$ repetitions, report the descriptive statistics $($minimum$,$ maximum, and average$)$ of the

solution depth for each n for each solution.

d$.$ Across the $10$ repetitions, report the descriptive statistics $($minimum$,$ maximum, and average$)$ of the

maximum number of states concurrently stored for each n for each solution.

$3.$ Comment on the results. Include the results of BFS$,$ DFS$,$ and DFS with revisit check in your

discussion