Here is the iterative implementation of binary search: For each call to binary_search below, indicate how many times the code inside the while loop will execute.  animals = ["aardvark", "cat", "dog", "elephant", "panda"] 1. binary_search("elephant", animals)                                                                                           2. binary_search("dog", animals)                                                                                           3. binary_search("anteater", animals

+ enuity.com/Player/ emester A 4 5 Mark this and return M BO DELL A user is going to process an unspecified quantity of numbers. The desired result is to have the numbers ordered from smallest to largest. Which statement is true? Select three options. You could use a loop to add the numbers to a list, and then use an insertion sort to order the list. You could use a loop to add the numbers to a dictionary, and then use a built-in sort method to sort the dictionary. You could use a loop to ask the user for the numbers, adding them to a list. Then use the built-in sort method to order the list. You could use a loop to add numbers to a list. Then use a binary search to sort the list. You could use a spreadsheet to enter the numbers, and then use the spreadsheet sort method from the menu to sort the numbers. Save and Exit Next < English Sign out Kinley TIME REMAINING 57:01 Submit D Mar 27 12:0

Modify the quick sort implementation in the textbook to sort the array using pivot as the median of the first, last, and middle elements of the array. Add the modified quick sort implementation to the arrayListType class provided (arrayListType.h). Ask the user to enter a list of positive integers ending with -999, sort the integers, and display the pivots for each iteration and the sorted array. Main Function #include <iostream>#include "arrayListType.h"using namespace std; int main(){ arrayListType<int> list;int num;cout << "Line 8: Enter numbers ending with -999" << endl;cin >> num; while (num != -999){list.insert(num);cin >> num;} cout << "Line 15: The list before sorting:" << endl;list.print();cout << endl; list.selectionSort();cout << "Line 19: The list after sorting:" << endl;list.print();cout << endl; return 0;}   Header File (arrayList.h) Including images #include <iostream>#include <cassert>…

1. The codewords will be scrambled words. You will read the words used for the codes from a file and store it into an array. There are 60 words in the file that range in size from 3 characters to 7 characters. The file is called wordlist.txt and can be found attached to the assignment in IvyLearn.2. Start with input for an integer seed for the random number generator. There is no need to put a prompt before the cin operation.3. Ask the Player if they are ready to play and only proceed if they type a Y or y. If the user types an N or n then the program should finish. a. INPUT VALIDATION: Make sure the user has typed either y, Y, n, or N4. Create a variable to keep track of the number of guesses the user has made.5. Use the random number generator to pick a word from the list of words.6. Once you have chosen a word as the codeword you will need to scramble the letters to make it into a code. You should use the random number generator to help you mix up the letters.7. Display to the user…