I need help with the following question

Write a program to solve the 8-puzzle problem (and its natural generalizations) using the A* search algorithm.

The problem. The 8-puzzle problem is a puzzle invented and popularized by Noyes Palmer Chapman in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks from the start state to the goal state. You are permitted to slide blocks horizontally or vertically into the blank square.

Here is the start state:

2 8 3

1 6 4

7 0 5

Here is goal state:

1 2 3

8 0 4

7 6 5

I need this wirtten in java

Please help

Thanks