Write a program that solves N$-$puzzle in n$*$n grid such that you rearrange the square blocks of the

puzzle to be in order with the fewest possible moves. The puzzle includes $1$ to N numbers with

one blank space and you can move the squares horizontally and vertically into the blank space.

$8-$puzzle is a $3*3$ grid labeled $1$ though $8$ and one blank square. $15-$puzzle is a $4*4$ grid labeled $1$

through $15$ and one blank square. Use A$*$ search algorithm in your implementation