heuristic search will the best first search algorithm find an optimal solutionwhy or why not will the aalgorithm find an optimal solutionwhy or why not when would hill climbing be better to use than the aalgorithm what is forward checking and how does that help solve problem describe what happens in the depth first search algorithm when backtracking occurs be specific about how the algorithm behaves at the point when backtracking occurs in sect name game that cannot use the minimax algorithm other than poker what is the best way to insure that minimax behaves as desireda really good heuristic or deeper search programming problems write program that uses the five search algorithms in this to search maze as shown in the examples construct sample mazes by writing text file where each space represents an open location in the maze and each non-space character represents wall in the maze start the maze with the number of rows and columns of the maze on the first two lines of the file assume that you search the maze from top to bottom to find way through it there should be only one entry and one exit from your maze compare and contrast the different algorithms and their performance on your sample mazes be sure to download the maze searching front-end from the text' website so you can visualize your results the architecture for communication between the front-end and your back-end code is provided in the front-end program file write program to solve the knight' tour problem be sure to use heuristic in your search to narrow the search space make sure you can solve the tour quickly for an board draw your solution using turtle graphics write program to solve the -queens problem use forward checking and heuristic to solve the -queens problem for an board for an extra challenge try to solve it for board the program will likely need to run for while ( half hour?to solve this one be sure to use the -queens front-end code provided on the text' website to visualize your result the back-end code you write should follow the architecture presented at the top of the front-end program file write the connect four program to challenge another student' connect four you both must write programs that have pass button flip of coin can determine who goes first the one who goes first should begin by pressing their pass button then you and the other student can flip back and forth while your computer programs compete to keep things movingyour game must make move within or it forfeits you can use the front-end code presented in sect as your frontend you must write the back-end code follow the architecture to communicate with the front-end code presented at the top of the front-end program file for an extra challengewrite the connect four program and beat the program provided by the authors on text website to run the author' code you must have this copy belongs to 'acha