Question 1) for this assignment you are required to solve the N-Queen problem using a local searc...

Question 1) for this assignment you are required to solve the N-Queen problem using a local search algorithm of your choice. You can implement your solution in the programming language of your choice. The pseudo-code of all the search algorithm can be found in your text-book (i.e. AIMA). You can use the Number-Of-NonAttacking-Queens as a heuristic. You are also required to measure the time required by your algorithm to find a solution as the number of N increases. For this, you can test your algorithm for 5,6 increasing values of N for e.g. you can test for N = {4, 8, 10, 20, 50, 100}