Description Given the array shown below. Write Java programs to: 1. Sort the array using any sort algorithm of your choosing (selection, bubble, merge sort, etc.) 2. Search the array (sorted or unsorted) using a linear search for the following elements: 15, 95, 1, 80 3. Search the sorted array for the same elements listed in 2. above using binary search. This should be done using a while loop and recursively. myArray = {5, 3, 7, 12, 43, 15, 2, 40, 34, 27, 80, 54, 27, 17, 29, 33}