Solve the problem to find an optimal solution using an A* algorithm with BEST-FIRST-SEARCH

1) Implement the problem to solve it. Use any programming language of your preference.

2)Your output has to print the following result:

a) the optimal solution? Represent your optimal solution as a sequence of states.

b) the optimal cost of solution (i.e. f (Goal))?

W W w W w The puzzle has two legal moves (i.e. actions) with associated costs: 1. A title may move into an adjacent empty location. - This has a cost of 1. 2. A title can hop over one, two or three other tiles into the empty position. - This has a cost equal to the number of tiles jumped over + 1: i.e. a cost of 2, 3 or 4. The goal is to have all the white tiles to the right of all the black tiles. The position of blank is not important. W W w W w The puzzle has two legal moves (i.e. actions) with associated costs: 1. A title may move into an adjacent empty location. - This has a cost of 1. 2. A title can hop over one, two or three other tiles into the empty position. - This has a cost equal to the number of tiles jumped over + 1: i.e. a cost of 2, 3 or 4. The goal is to have all the white tiles to the right of all the black tiles. The position of blank is not important