Develop and implement a recursive algorithm to solve $$the Eight Queens Problem$[1]$ in Python. Your algorithm shall work on generic NxN board sizes. You shall provide the following deliverables:

Note: There are plenty of implementations of the Eight Queens Problem. Most of them define is$\_$safe$()$ function, which checks whether a given square is attacked by any of the queens. Do not use that function. You shall define a function which will mark the squares attacked by a queen.

Your report that includes

Problem definition,

Your approach to the problem,

Pseudocode of the algorithm,

Results and discussion.