During the previous lecture, we discussed an algorithmic approach to the N$-$Queens problem where the row index is passed as a parameter to the recursive function, and we loop over all the columns for each recursive call.

If we modify the function to pass the column index as a parameter and loop over all the rows for each recursive call, which of the following statements would be true regarding the is$\_$safe$($board$,$ row, column$)$ function? $($Select only one$)$

During the previous lecture, we discussed an algorithmic approach to the N$-$Queens problem where the row index is passed as a parameter to the recursive function, and we loop over all the columns for each recursive call.

If we modify the function to pass the column index as a parameter and loop over all the rows for each recursive call, which of the following statements would be true regarding the is$\_$safe$($board$,$ row, column$)$ function? $($Select only one$)$

We need to check for queens in the upper left diagonal, lower left diagonal, and same row of the board

We need to check for queens in the upper right diagonal, lower left diagonal, and same column of the board

We need to check for queens in the upper left diagonal, lower left diagonal, and same column of the board

We need to check for queens in the upper left diagonal, lower right diagonal, and same row of the board