In this case study, your task is to study different searchalgorithms to solve the N-Queens Problem which has been presentedin class. We will focus on the incremental formulation in which weadd a queen to any square in the leftmost empty column that is notattacked by any other queen. We will compare the followingalgorithms:
1- Breadth-first Seatch (BFS)
2- Depth-first Search (DFS)
3- Simulated Annealing (SA)
4- Hill Climbing (HC)
Question is:. Using any of the mentioned algorithims, is there asolution for the 4-Queens Problem? Demonsrate your answer.