QUESTION 1 Perform Selection Sort on the array below. What are the results after the fifth pass to the outer loop? Five elements should be sorted. Change min only if the current element is less than the min. B E X M P E G List the contents of the array, with each value separated by spaces QUESTION 2 Perform Insertion Sort on the array below. What are the results after the fifth pass to the outer loop Six elements should be in the sorted section, as the O-index element starts off in the sorted section B G E X M P E List the contents of the array, with each value separated by spaces. QUESTION 3 Perform Merge Sort on the array below as done in the slide example. Show the operation of the top-level of the recursion M E R G E E X M L E What is the data in the Left subarray after the top-level split (but before the recursive calls)? List the contents of the array, with each value separated by spaces QUESTION 4 Using the array in the previous problem, what is the data in the Right Subarray after the top level split (but before the recursive calls)? List the contents of the array, with each value separated by spaces