N-Queen puzzle is a problem in artificial intelligence. It consists of N Queens and Nx N square grid (chessboard). The goal is to find a solution of placing all queens on the chessboard so that no two queens threaten each other (i.e. no two queens share the same row, column, or diagonal). It is required to develop a program in Python to compare to compare the performances of utilizing A* search and genetic algorithm search in solving this puzzles. 8 7 6 5 W 4 3 1 2 3 4 5 6 7 8 Develop a program Python with a GUI that shows the chessboard and list of algorithms implemented to solve the N-Queen Problem. The use selects one of the algorithms then clicks Run button to start solving the puzzle using the selected algorithm, where the steps of moving the queens on the chessboard are visually traced. Once a solution is KFUPM: 202-ICS381-PA01 Page 1 of 2 found, the program shows the number of steps and execution time. When the user clicks the Stop button, the program stops searching for a solution. Since this assignment is for learning purpose, do not use exiting online solutions or packages for Al algorithms. However, you can packages for implementing the GUI. Use multiple classes and methods for each approach. For the genetic algorithm, allow the user to set the parameters and operations, e.g. population size, number of generations, crossover (single point, multi-point, crossover rate), mutation rate, recombination with/without elitism. Assume any missing information and be creative. Follow good programming practices in writing clear and commented code