Consider the 6-Queens problem. That is the problem of placing 6 Queens on a hypothetical 6x6 chessboard so that no two Queens can attack each other. Draw the remaining search state space tree explored by this algorithm considering first two steps are already known as shown in the following figure. 3 6