-Use this array of integer for the problems 1A, 1B, and 1C: 7 5 2 911 4 3 6 - Each of these problems is worth 3 points. A. B. C. Show the contents of the array each time a selection sort changes it while sorting the array into ascending order. Show the contents of the array each time an insertion sort changes it while sorting the array into ascending order. Show the contents of the array each time a Shell sort changes it while sorting the array into ascending order. D. 2 points-Suppose you want to find the largest entry in an unsorted array of n entries. Algorithm A searches the entire array sequentially and records the largest entry seen so far. Algorithm The array 1s initially B sorts the array into descending order and then reports the first entry as the largest. Compare the time efficiency of the two approaches. 3 4 5 1 2 5 2 3 4 E. 10 pointsConsider an n by n array of integer values. Write an algorithm to sort the rows of the array by their first value. Implement your algorithm. The code for this problem is provided in the Assignment-03-Code.zip archive. The array after sorting is Your output must be identical to the output to the right. PART 2-Queues, Deques, and Priority Queues, 19 points A. 3 points After the following statements execute, what are the contents of the queue? Queuelnterface String> myQueue new LinkedQueueo0 myQueue.enqueue( Jane"); myQueue.enqueue( Jess") myQueue.enqueue("Jill") myQueue.enqueue(myQueue.dequeue() myQueue.enqueue(myQueue.getFront() myQueue.enqueue("Jim String name myQueue.dequeue() myQueue.enqueue(myQueue.getFront(): Updated: 3/7/2018 12:10 PM