Part A: Brute Force The N-Queens Problem is the problem of placing N queens on an NxN board so that no two queens are in the same row, column or diagonal. Discuss how you could represent solutions to the 4 -Queens Problem (That is, N=4 ). Write an algorithm that generates all possible ways that 4-Queens can occupy a 4x4 board so that no two queens occupy the same row or the same column. (Note: For this task, you do not need to check if any two Queens occupy the same diagonal. However, a proper solution for the N-Queens problem would require you to do so.) Part B: Backtracking Create an algorithm that uses backtracking to solve the N-Queens Problem. Each person in your group should be responsible for a different function of the algorithm. Step through the algorithm for the n=4 case