NQueens: Write a brief Python program to generate a more-informed random solution to the N-Queens problem (described on pages 71-72). Your program should:

Prompt the user for a value for N (for an NxN board)

Generate a smarter randomized candidate NQ solution (unique rows & columns)

Count the number of conflicting pairs of queens

Repeat the previous two steps until you get a solution

Print the solution and the number of iterations the solution took

BONUS (10pts) - make your NQ app "pretty print" the nxn board of queens as follows:

n=4, NQ = [1,3,0,2]:

-Q--

---Q

Q---

--Q-

Pseudocode:

# NQueens_yourInitials.py import random # ask the user for an N value # generate a candidate NQ solution  list(range(n)) # define a function to count number of conflicts() # while number of conflicts in NQ > 0 # randomize (or improve) NQ  shuffle! # print NQ # print number of iterations