This is needed urgent please answer soon. Thank you verymuch!
In HW4.java, you will use breadth-first search to test if agiven “8-puzzle” configuration is solvable.
8-puzzle rules
The puzzle consists of a 3×3 grid, with 8 tiles, labeled 1 to 8,and one empty slot. You can move a tile horizontally or verticallyinto the empty slot, to move from one configuration to another. Theinitial configuration is “solvable” if it is possible to reach thegoal configuration.
This initial configuration is solvable because it is possible toreach the goal configuration.
Graph representation
Each configuration will be represented by a Configuration object(the Configuration class has been given
OR
OR