Comparison Between the Backtracking algorithm and the Greedy Algorithm to solve the n-Queens Problem IMPORTANT NOTE You can consult books in the library to learn more about the backtracking and the greedy algorithms. There are many books and other resources available. You should implement the backtracking algorithm to solve the problem and show for which value for n you can get a solution. Record also the time. You should then implement the greedy algorithm and give also the value for n (the number of queens) and the time. Programming I'd prefer not to place restrictions on the programming language. Most languages should have access to a decent sorting library, but be sure to look into this before you commit to an approach