Below question needs to be done in diagram as a reference(red diagram). It is not included in the question. That is done by me. Please help me create a diagram similar to it. Please and Thankyou.

For the 3 queens problem, how many different arrangements of 3 queens (Q1,Q2,Q3) are possible in a 33 chessboard under the following conditions: - Queens in the same rows, columns or diagonals as other queens are considered under attack. The arrangements you are counting should be such that no queens should be under attack. - Q1 should be in row 1,Q2 should be in row 2,Q3 should be in row 3 . Derive the arrangement/s by drawing a state space tree and illustrating backtracking. Finally list out the arrangements. Note: The graph (tree) that you see in n-Queens problem Backtracking: Recording is called the state space tree