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

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

Which of the following is true about Row-major order?Row-major order starts at the bottom left of the 2D array (when viewing it as a matrix) and traverses up each column until it ends at the top right corner.Row-major order starts at the top right of the 2D array (when viewing it as a matrix) and traverses across each row until it ends at the bottom left corner.Row-major order starts at the top left of the 2D array (when viewing it as a matrix) and traverses down each column until it ends at the bottom right corner.Row-major order starts at the top left of the 2D array (when viewing it as a matrix) and traverses across each row until it ends at the bottom right corner.

Consider a two-dimensional array C[12][6] stored in row-major order. Assume there are 3 words per memory cell, the base address of array C is 300, and the first element is C[0][0].What is the address of C[9][2]?

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)

Which of the following statements is true about the order of elements in the matrix array in Java? a. Java stores 2D arrays in column-major order, so elements are stored column by column. b. Java stores 2D arrays in row-major order, so elements are stored row by row. c. Java allows you to specify whether a 2D array should be stored in row-major or column-major order. d. Java does not support 2D arrays directly; it only supports arrays of arrays.