Consider different heuristics for the 8-queens problem . One heuristic is - place a queen in the column with the fewest unattacked squares, in such a way that it does not attack any other queens. How many nodes does this expand before it finds a solution? If there are ties, the leftmost square should be tried first (you should write a program to determine this). Now, find another heuristic for this problem. How many nodes does your heuristic expand before it finds a solution? Does your heuristic generalize to the n-queens problem? Explain.