The 8-queens problem is a famous problem that has been studied for more than a century. The problem statement is as follows: In the game of chess, a queen can attack along vertical, horizontal and diagonal lines. Given a chessboard (8 8 squares), find a way to place 8 queens on the board such that no two queens are attacking each other. Solve the 8-queens problem in Python. You are required to output 8 positions ((x, y) format) that correspond to a solution of the problem. Assume that the bottom left square is at position (1,1) and top right square is at position (8,8). Use a purely imperative style (No object-oriented style and no recursion). Consider the following variant: Assume that you have a modified chessboard that has 8 n squares. The chessboard has holes in it, such that you cannot place a queen on squares that have a hole. However, queens can still attack over holes (i.e., they can jump over them). Find the maximum number of queens you can place on the chessboard and print their positions. Bonus: The most elegant code will receive a bonus