A board game consists of a grid formed by 7 rows and 7 columns, seven white and seven black tiles are on the board can be moved around. At initial, all the tiles are randomly put at the board; each of them occupies a position. A goal configuration is that all white tiles are at the first row and all black tiles are at the seventh row. A legal move is to put a tile into one of its 4-neighbers which is empty; this has a cost of 1. I he goals of the game is from the start state to find a series of moves that reaches a goal state by a minimum cost. Propose two A* algorithms that solve this problem (except the breadth-first algorithm). Compare the un forcedness of your proposed A* algorithms and give your reason. A board game consists of a grid formed by 7 rows and 7 columns, seven white and seven black tiles are on the board can be moved around. At initial, all the tiles are randomly put at the board; each of them occupies a position. A goal configuration is that all white tiles are at the first row and all black tiles are at the seventh row. A legal move is to put a tile into one of its 4-neighbers which is empty; this has a cost of 1. I he goals of the game is from the start state to find a series of moves that reaches a goal state by a minimum cost. Propose two A* algorithms that solve this problem (except the breadth-first algorithm). Compare the un forcedness of your proposed A* algorithms and give your reason