Test time left: 02:15:05 An n-rooks problem (similar to n-queens problem) is that given an integer n, the task is to place the maximum number of rooks that can be placed on an nxn chessboard so that no two rooks attack each other. For example, maximum 2 rooks can be placed safely on 2 x 2 chessboard. Solve this problem for n=4 by backtracking formulation.[Rooks (we generally call elephant or ship or castle) on a chessboard can move only through the same row or column to any distance]. Once you upload files from your second device, click on S Sync to check your submission