Try to make it simple and easy to understand.

Your program will sort a two dimensional array (5 * 4) based on the following: a) The entire array should be sorted using bubble sort based on the 1"column in ascending order and display the entire array. b) Reset the array to its original contents. The entire array should again be sorted using selection sort based on the 2 column in descending order and display the entire array c) Reset the array to its original contents. The entire array should again be sorted using shell sort based on the 3" d) Reset the array to its original contents. The entire array row in ascending order and display the entire array Ask the user for a number, search for that number in the 5 column in ascending order and display the entire array should again be sorted using insertion sort based on the 5 row of the array that was sorted via insertion sort, using binary search. Display the entire column. Your array could be declared as a global variable since it is being used everywhere For example, given the following array: 532 16 981017 4711 18 259 12 794 10 16 17 18 12 Insertion l column 2d column 3rd column Bubble Selection Shell Ascending Descending Ascending