1. State and explain N Queens Problem. Write the backtracking algorithm for solving N Queens problem. Show the state space tree for 4 Queens problem. Show the steps in solving 4 Queens problem using backtracking method to print all the solutions.

2. Differential between backtracking and branch bound techniques. Write an algorithm for sum of subset using backtracking approach. Find all possible solution for M=30, write complete state space representation for given values S=<1,2,5,7,8,15,20,25>