Problem 3.4 (6 points): Jamie is writing code to sort an array of integers and decides to use for "enhanced" version of the insertion sort. Recall that when determining the correct position values to the right are not yet sorted. Jame the left of the current element are sorted and the element to be inserted, Jamie uses a biniery sort on the sorted part of the array. your answer. Problem 3.5 (4 points) Given the array {7,44,6,5,3,4,88,13} During the middle of a sorting process, the array looks like {3,4,5,6,7,44,88,13} What sorting algorithm below could have been used? 1. Insertion 2. Selection 3. Merge A. 1 and 2 B. 2 and 3 C. 1 and 3 D. 1,2 and 3 Problem 3.6 (9 points - 3 each) A. Merge Sort B. Insertion Sort C. Selection Sort Dut of the three sorting algorithms listed above, what is the best sorting algorithm in the ituation that: 1. You know that the array is mostly sorted : 2. You don't know anything about the order of items in the array : 3. You have a relatively small array