Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute M1 × M2 will be*2 pointsbest if A is in row-major, and B is in column- major orderbest if both are in row-major orderbest if both are in column-major orderindependent of the storage scheme

If column-major order is used, how is the following matrix stored in memory?

The time complexity to access an element in a 2D matrix by row-major order is:O(1)O(log n)O(n)O(n^2)

Given 2 matrices A and B of size NxM. You have to find the sum between 1st row of matrix A and Nth row of matrix B, 2nd row of matrix A and (N-1)th row of matrix B and so on.Input FormatFirst line of input contains N,M - the size of the matrices. Its followed by 2xN lines, each containing M integers - elements of the matrices. First N lines for matrix A and the next N lines for matrix B.Output FormatPrint the sum of row 1 of A and row N of B, row 2 of A and row (N-1) of B and so on.Constraints1 <= N, M <= 100-102 <= mat[i][j] <= 102ExampleInput3 33 -2 51 3 44 0 72 2 4-8 4 37 1 9Output23719ExplanationSelf Expla

A powerful array for an integer x is the shortest sorted array of powers of two that sum up to x. For example, the powerful array for 11 is [1, 2, 8].The array big_nums is created by concatenating the powerful arrays for every positive integer i in ascending order: 1, 2, 3, and so forth. Thus, big_nums starts as [1, 2, 1, 2, 4, 1, 4, 2, 4, 1, 2, 4, 8, ...].You are given a 2D integer matrix queries, where for queries[i] = [fromi, toi, modi] you should calculate (big_nums[fromi] * big_nums[fromi + 1] * ... * big_nums[toi]) % modi.Return an integer array answer such that answer[i] is the answer to the ith query. Example 1:Input: queries = [[1,3,7]]Output: [4]Explanation:There is one query.big_nums[1..3] = [2,1,2]. The product of them is 4. The remainder of 4 under 7 is 4.Example 2:Input: queries = [[2,5,3],[7,7,4]]Output: [2,2]Explanation:There are two queries.First query: big_nums[2..5] = [1,2,4,1]. The product of them is 8. The remainder of 8 under 3 is 2.Second query: big_nums[7] = 2. The remainder of 2 under 4 is 2. Constraints:1 <= queries.length <= 500queries[i].length == 30 <= queries[i][0] <= queries[i][1] <= 10151 <= queries[i][2] <= 105

Explain Stassen’s matrix multiplication and analyze the time complexity