Local search algorithms are very efficient in solving n-Queen problems. You are asked to implement the following two algorithms to solve the n-queen problem: 1) Straight-forward steepest-ascent hill climbing as described on page 9 of our lecture "local search". 2) Your choice of one of the following algorithms: simulated annealing search algorithm (page 18 of our “local search” lecture); the genetic algorithm (page 26 of our "local search" lecture); or the MIN-CONFLICTS algorithm (page 42 of our "CSP" lecture).