How to identify time and space complexity of recursive backtracking algorithms with step-by-step analysis

Question

Background Information: I solved the N-Queens problem with the C# algorithm below, which returns the total number of solutions given the board of size n x n