***NOTE: ALL IN C LANGUAGE

Create a two dimensional array (e.g. int A2D [ M j[N];) of size M x N to store integer values. Use #de fine M 6 and N 5 to start. (Using symbolic constants instead of hard coding the array sizes improves scalability). 1. M x N, inclusive, so that every array element is unique (no duplicates). 3. Print the array in a table format (use formatting codes to achieve this). 4. Use Linear Search to find if a number n is found in the array, where n is an integer between 1 and M x N (inclusive) entered by the user 5. Apply a single LEFT shift operation to the array. LEFT shift means move every element one position to the LEFT, the first element becomes the last one, and the first element in each row moves up to become the last element in the previous row Example: Left shift of a 2 x 4 array: 4 8 32 56 17 becomes: 8325 6 174 6. Print the shifted array