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.

Use a purely IMPERATIVE STYLE (NO object-oriented style and NO recursion).