For h(n) use sum of distances out of place (hamilton distance).

Make sure to write your name in main method.

3- Create an input file as follow:

3

1 3 2 5 0 4 8 7 6               1 3 2 5 7 4 8  6  0

1 5 2 0 8 6 3 7 4               1 2 3 4 5 0 8  7  6 

1 3 2 5 0 4 8 7 6               0 1 3 2 5 7 4  6  8

4- For each input print:

Initial state, Goal Sate, the no. of moves as well as moves from initial state to goal

state. for example:

Initial state: 1 3 2 5 0 4 8 7 6,

Goal State:  1 3 2 5 7 4 8  6  0,  

10 moves: L, R, D, ……..

*private void puzzle(int cs[], int gs[]){ //complete this method, on attached file.