In the artificial intelligence class, you will implement the hill climbing algorithm in python to solve the 8-queen problem. There are two versions of the algorithm: (1) Random-restart hill climbing and (2) First-choice hill climbing with random-restart. For both algorithms, your program will print the final board configuration, the number of attacking pairs in the board, and the total time required to reach the final state. You will execute both programs 10 times each. Observe and report the total time taken and the number of attacking pairs in the final states. Which program is producing more solutions with 0 conflicts? Why? Which program is faster? Why? Explain.