Problem StatementGurpreet is working on a programming task involving matrices. The objective is to write a program that processes a given matrix based on specific rules. The program should first accept the number of rows and columns as input. Following this, it should take a matrix of the specified size (rows x columns) as input. The core logic of the program should identify any row or column that contains at least one zero. Once identified, the program should modify the matrix by replacing every element in these rows and columns with zeros.The final output should be the modified matrix, where all rows and columns that originally contained at least one zero element are filled with zeros.Input format :The first line consists of two integers r and c, separated by a space, representing the number of rows and columns in the matrix.The next r lines contain c space-separated integers, representing the elements of the matrix.Output format :If there are zeros in the matrix, display the modified matrix after replacing rows and columns with zeros if any element in the row or column is zero. If there are no zeros in the matrix, display the given matrix as it is.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ r, c ≤ 80 ≤ elements ≤ 9Sample test cases :Input 1 :2 21 04 9Output 1 :0 0 4 0 Input 2 :3 41 0 2 30 4 5 67 8 0 9Output 2 :0 0 0 0 0 0 0 0 0 0 0 0 Input 3 :8 81 0 2 3 7 8 6 20 4 5 6 4 2 3 27 8 0 9 2 3 4 72 3 8 0 7 8 4 61 2 3 4 5 6 7 82 5 8 7 4 1 3 42 4 6 9 7 8 1 30 1 4 7 2 3 7 3Output 3 :0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 6 7 8 0 0 0 0 4 1 3 4 0 0 0 0 7 8 1 3 0 0 0 0 0 0 0 0

Problem StatementHarpreet is a student learning about matrix multiplication. She wants to write a program to multiply two matrices, a and b, each of size N x N. Can you help her with the code?Write a program that takes an integer N as input and two matrices a and b of size N x N. Implement matrix multiplication and print the resulting matrix c.Note: A square matrix is where the number of rows equals the number of columns.Input format :The first line of input consists of an integer N, representing the matrix size.The next N lines consist of N space-separated elements in each line, representing the first matrix.After being separated by a new line, the next N lines consist of N space-separated elements in each line, representing the second matrix.Output format :The output prints the product of two matrices.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ N ≤ 80 ≤ elements ≤ 9Sample test cases :Input 1 :32 3 23 2 33 3 34 5 62 3 11 2 3Output 1 :16 23 21 19 27 29 21 30 30 Input 2 :22 22 35 07 8Output 2 :24 16 31 24 Input 3 :81 5 2 4 7 3 2 12 3 4 5 6 7 8 94 5 6 1 2 3 7 82 5 8 7 4 1 9 61 4 7 8 5 2 6 99 8 6 4 7 5 1 27 5 3 9 5 1 4 83 4 8 9 7 1 2 05 8 7 4 6 1 2 09 7 4 5 6 3 2 17 5 6 8 4 1 2 31 4 5 2 3 9 8 72 5 8 7 4 3 6 94 5 8 7 1 0 0 11 5 6 7 8 4 2 23 2 1 4 3 5 3 6Output 3 :99 131 152 141 106 88 97 115 145 200 236 248 183 155 137 181 155 177 179 207 172 108 88 113 157 201 217 233 202 166 146 169 149 186 206 223 179 176 157 194 204 243 255 231 185 110 128 136 152 208 212 197 188 177 164 179 136 178 206 184 146 133 148 159

Question26Max. score: 2.00In Data Structures, John has executed the following pseudocode to perform an operation with the following input values. Then determine x with the respect to the following input values:Pseudocode:input A,B n*n matrixoutput C n*n matrixdefine i, j, kfor i from 0 to n for j from 0 to n C[i,j] = 0 end forend forfor i from 0 to n for j from 0 to n for k from 0 to n C[i, j] = C[i, j] + A[i, k] * B[k, j] end for end forend forInput values:N = 2A[N][N] = { {1, 2}, {3, 4} }B[N][N] = { {5, 4}, {1, 2} }Output:C[N][N] = xOptions:7 198 208 207 197 819 2019 207 81234

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.

In Data Structures, John has executed the following pseudocode to perform an operation with the following input values. Then determine x with the respect to the following input values:Pseudocode:input A,B n*n matrixoutput C n*n matrixdefine i, j, kfor i from 0 to n for j from 0 to n C[i,j] = 0 end forend forfor i from 0 to n for j from 0 to n for k from 0 to n C[i, j] = C[i, j] + A[i, k] * B[k, j] end for end forend forInput values:N = 2A[N][N] = { {1, 2}, {3, 4} }B[N][N] = { {5, 4}, {1, 2} }Output:C[N][N] = xOptions:7 198 208 207 197 819 2019 207 8

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