You are given an integer N denoting an N×N matrix. Initially, each cell of the matrix isempty. You are given K tasks. In each task, you are given a cell (i, j) where cell (i, j)represents the ithrow and jth column of the given matrix.You have to perform each task sequentially in the given order. Each task is describedin cell (i, j). For each task, you have to place X in each cell of row i and each cellcolumn j. After you complete each task, you are required to print the number ofempty cells in the matrix.

You are given a job which has been divide into N tasks. The task cannot be divided any further. Each of the N tasks takes Si number of seconds to complete. Your job will be completed when all your tasks are completed. You have K workers at your disposal to help you complete the tasks. But as per the nature of the job, a worker can only be allocated continuous tasks. A worker can work only on a single task at any given point of time. However, the workers can work in parallel on different tasks. You have to find the minimum possible time in which you can complete the job.Input FormatFirst line of input contains T - number of test cases. Its followed by 2T lines. First line of each test case contains N and K - number of tasks and available workers for the current job, separated by space. The next line contains N positive integers - denoting the time taken to complete the ith task.Constraints50 points1 <= N,K <= 20150 points1 <= N,K <= 10000General Constraints1 <= T <= 501 <= Si <= 103Output FormatFor each test case, print the minimum possible time in which you can complete the job, separated by newline.Sample Input 0610 31 10 13 4 5 12 23 12 18 8 8 417 27 22 45 26 32 45 16 2 274 61 7 374 24 61 81 66 76 51 2 154 10 4 215 30 10 50 Sample Output 03866741596455Explanation 0Self Explanatory

Write a  program to print Transpose of a matrix.First, take as input the number of cells of a square Matrix.Next, n inputs will be "n" columns separated by space for each row

You are given a matrix of integers. Your task is to write a program that takes the dimensions of the matrix and its elements as input, and then prints the matrix.Input:3 31 2 34 5 67 8 9Output:1 2 34 5 67 8 9

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

You work in the examination department of a school, and you've been given a task to sort the test scores of students in ascending order. The scores are stored in a list where each element represents the score of a student.Input FormatThe first line contains the integer N, the size of the array. The next line contains N space-separated integers.Constraints• 1<=N<=1000 • -1000<=a[i]<=1000Output FormatPrint the array as a row of space-separated integers in each iteration.Sample Input 01010 9 8 7 6 5 4 3 2 1Sample Output 05 9 8 7 6 10 4 3 2 15 4 8 7 6 10 9 3 2 15 4 3 7 6 10 9 8 2 15 4 3 2 6 10 9 8 7 15 4 3 2 1 10 9 8 7 63 4 5 2 1 10 9 8 7 63 2 5 4 1 10 9 8 7 61 2 3 4 5 10 9 8 7 61 2 3 4 5 10 9 8 7 61 2 3 4 5 10 9 8 7 61 2 3 4 5 8 9 10 7 61 2 3 4 5 8 7 10 9 61 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 10