Implement a Python program that places 8 Queens on an 8x8 chess Board so that no queen

can take another Queen (Use a 1 for a Queen and a 0 for an empty square.

a) Since there are 8^8 possible placements of the Queens, this would lead to an very large Search Tree.

Show how a "smart" search tree can be generated, so that the searching can be done more efficiently to find the solution

b) What Python data structure could be used to implement th finding of the solution in Python

c) Write a Python program to solve this problem.