Consider a scenario where you need to solve the N$-$Queens problem,

where you have to place N queens on an NxN chessboard in such

a way that no two queens threaten each other. Which of the following

statements about backtracking in the context of solving the N$-$

Queens problem is true?

Options

Backtracking guarantees finding the optimal solution in

polynomial time.

Backtracking is not suitable for solving the N$-$Queens problem

due to its exponential time complexity.

Backtracking ensures finding all possible solutions without

exploring unnecessary paths.

Backtracking always requires sorting the input data before

exploring solutions.