analysis of algorithms:

Problem: N-Queens We would like to place n queens on an n x n chessboard, therefore no queen could ever take any of the other n queens. The brute-force algorithm has poor characteristics, so we want you to design a more efficient one. Input: you are given the size n such that n > 4 Output: return a 2D binary matrix whose dimension is nxn that represents the chessboard. A value of 1 means there is a queen in such position. Example: TO 1 0 0 0 0 0 1 1 0 0 0 0 1 0 0 Requirements: i) develop a python function that implements your efficient, correct algorithm ii) empirically, test your function while varying the chessboard size, n, to have an intuition over the complexity of your algorithm. iii) show the complexity analysis of your algorithm, theoretically, from the perspective of space and time. iv) write a function to visualize your solution