Problem StatementHarish is developing a program for a robotics project that involves processing a 2D grid. The program requires rotating a 2D matrix 90 degrees clockwise in place.He needs to implement the rotateMatrix function to achieve this rotation without using any temporary arrays or data structures, only dynamic memory allocation. Additionally, he needs to provide functions to display the original and rotated matrices. Write a program to accomplish this task.Note: This kind of question will help in clearing HCL recruitment.Input format :The first line of the input consists of an integer 'n', which represents the size of the square matrix (n x n).The second part contains 'n x n' integers representing the elements of the matrix in row-major order.Output format :The first matrix is the original matrix.The second matrix is the matrix after a 90-degree clockwise rotation.Refer to the sample output for formatting specifications.Code constraints :1 <= n <= 100Sample test cases :Input 1 :31 2 34 5 67 8 9Output 1 :Original Matrix:1 2 3 4 5 6 7 8 9 Matrix after 90-degree clockwise rotation:7 4 1 8 5 2 9 6 3 Input 2 :-2Output 2 :Size of the matrix should be positive!Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

iven a 2D square matrix, rotate it by 90 degrees clockwise.Note:Try to solve it by first scanning the matrix, then doing an in-place rotation, and then printing the rotated matrix.Input FormatThe first line of input contains T - the number of test cases. The first line of each test case contains the N - the size of the matrix [NxN]. It is followed by N lines each containing N integers - matrix elements.Output FormatFor each test case, print the rotated matrix, separated by a new line.Constraints1 <= T <= 1001 <= N <= 100-100 <= ar[i][j] <= 100ExampleInput41121 24 331 2 38 9 47 6 55-44 25 -52 69 -517 22 51 27 -44-79 28 -78 1 -4765 -77 -14 -21 -6-96 43 -21 -20 90OutputTest Case #1:1Test Case #2:4 13 2Test Case #3:7 8 16 9 25 4 3Test Case #4:-96 65 -79 17 -4443 -77 28 22 25-21 -14 -78 51 -52-20 -21 1 27 6990 -6 -47 -44 -5

Problem StatementRaj, a coding hobbyist, is working on a binary matrix manipulation program. He wants to create a simple tool to input binary values in the form of a matrix and display the entered binary pattern. Write a program that takes the dimensions (rows and columns) of a binary matrix as input, reads the binary values, and then displays the entered binary pattern grid.Input format :The first line of input consists of two space-separated integers r, and c, representing the number of rows and columns of the binary matrix.The next r lines consist of c space-separated binary values (0 or 1) representing the elements of the array.Output format :The output displays the entered binary pattern grid.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:1 ≤ rows, cols ≤ 5Each cell of the matrix contains either 0 or 1.Sample test cases :Input 1 :4 31 0 11 1 01 1 10 0 0Output 1 :1 0 1 1 1 0 1 1 1 0 0 0 Input 2 :5 51 0 1 0 10 1 0 1 01 0 1 0 10 1 0 1 01 0 1 0 1Output 2 :1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 Input 3 :1 10Output 3 :0

Rotate an ArrayA group of students is working on a robotics project where a sensor array needs to be adjusted to avoid obstacles. They need a function to simulate rotating the sensor readings (an array of integers) to the right by a given number of positions.Write a function that rotates an array of integers to the right by a given number of positions.Constraints:NAExample:Input:51 2 3 4 51Output:5 1 2 3 4Explanation:Input:5  --->size of array1 2 3 4 5----->elements in array1 ---> number of shifts to be doneOutput:5 1 2 3 4  ---> array after rotating it by 1 step

#include <iostream>#include <vector>void rotateMatrix(int** matrix, int n) { // Transpose the matrix for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { std::swap(matrix[i][j], matrix[j][i]); } } // Reverse each row for (int i = 0; i < n; i++) { int left = 0; int right = n - 1; while (left < right) { std::swap(matrix[i][left], matrix[i][right]); left++; right--; } }}void printMatrix(int** matrix, int n) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { std::cout << matrix[i][j] << ' '; } std::cout << std::endl; }}int main() { int n; std::cin >> n; if (n <= 0) { std::cout << "Size of the matrix should be positive!" << std::endl; return 0; } // Allocate dynamic memory for the matrix int** matrix = new int*[n]; for (int i = 0; i < n; i++) { matrix[i] = new int[n]; } // Read the matrix elements for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { std::cin >> matrix[i][j]; } } std::cout << "Original Matrix:" << std::endl; printMatrix(matrix, n); rotateMatrix(matrix, n); std::cout << "Matrix after 90-degree clockwise rotation:" << std::endl; printMatrix(matrix, n); // Deallocate the dynamic memory for (int i = 0; i < n; i++) { delete[] matrix[i]; } delete[] matrix; return 0;}

Ben is studying matrices and wants to write a program that swaps two rows of a matrix (N, M), the program takes an input matrix, swaps the specified rows, and then displays the modified matrix.Assist him with the program.Input format :The first line consists of two space-separated integers N and M, representing the number of rows and columns in the matrix.The next N lines contain M space-separated integers each, representing the elements of the matrix.The last line consists of two space-separated integers r1 and r2, representing the row numbers to be interchanged.Output format :If the input row numbers r1 or r2 are invalid (less than 1 or greater than the number of rows), the output prints "Invalid row numbers".Otherwise, the modified matrix is printed after swapping the specified rows.