1. develop an array mapping function

2. Show all the work

3. Follow and answer all the bullet point.

2. Develop a formula, as in our discussion, to access an array element if the 2-dimensional array is stored in column-major order, i.e., array elements are stored in memory column-by-column rather than row-by-row. Number of columns we skip to get to the correct column in which our element is to be found: Number of rows in each column: Number of bytes each column occupy in memory: Number of bytes we skip in memory to get to the first memory location of the column in which our element is to be found? Starting location in memory for the column in which our element is to be found: Number of elements we skip in the correct column to get to the element whose memory location we're tying to locate? How many bytes do these elements occupy in memory? What is the memory location our element be found at? Simplifying the expression produces the following mapping function