Given file: arrayListType.h #include <iostream> #include <cassert> using namespace std; #ifndef H_arrayListType #define H_arrayListType template <class elemType> class arrayListType

Question 1 (25 pts):Assume the following list of keys:49, 4, 89, 25, 67, 46, 83, 30, 60, 22, 12This list is to be sorted using the quick sort algorithm as discussed in this chapter. Use pivot as the middleelement of the list, and fill in the blank squares below.pivotpivot pivotpivot pivot pivot pivotpivot pivotpivot pivot49, 4, 89, 25, 67, 46, 83, 30, 60, 22, 12Question 2 (25 pts):Assume the following list of keys:32, 47, 3, 28, 92, 7, 87, 37, 22, 43, 40, 74, 13, 35, 51This list is to be sorted using the merge sort algorithm as discussed in this chapter. Fill in the blank squaresbelow.32, 47, 3, 28, 92, 7, 87, 37, 22, 43, 40, 74, 13, 35, 51Question 3 (25 pts):Assume the following list:32, 47, 3, 28, 92, 7, 87, 37, 22, 43, 40, 74, 13, 35, 51, 14, 26, 5(a) Using the function buildHeap as given in this chapter, convert the list into a heap.(b) Show the resulting list after three passes of heapsort. (Use the heapify procedure as given in this chapter.)One pass:Two passes:Three passes:Question 4 (25 pts):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 classprovided (arrayListType.h). Ask the user to enter a list of positive integers ending with -999, sort the integers, anddisplay the pivots for each iteration and the sorted array.Submit the source code, and copy and paste the screenshot of the output here.

Given file: arrayListType.h

#include #include using namespace std;#ifndef H_arrayListType#define H_arrayListTypetemplate class arrayListType{public:const arrayListType& operator=(const arrayListType&);//Overloads the assignment operatorbool isEmpty() const;//Function to determine whether the list is empty//Postcondition: Returns true if the list is empty;// otherwise, returns false.bool isFull() const;//Function to determine whether the list is full.//Postcondition: Returns true if the list is full;// otherwise, returns false.int listSize() const;//Function to determine the number of elements in the list//Postcondition: Returns the value of length.int maxListSize() const;//Function to determine the size of the list.//Postcondition: Returns the value of maxSize.void print() const;//Function to output the elements of the list//Postcondition: Elements of the list are output on the// standard output device.bool isItemAtEqual(int location, const elemType& item) const;//Function to determine whether the item is the same//as the item in the list at the position specified by//Postcondition: Returns true if list[location]// is the same as the item; otherwise,// returns false.void insertAt(int location, const elemType& insertItem);//Function to insert an item in the list at the//position specified by location. The item to be inserted//is passed as a parameter to the function.//Postcondition: Starting at location, the elements of the// list are shifted down, list[location] = insertItem;,// and length++;. If the list is full or location is// out of range, an appropriate message is displayed.void insertEnd(const elemType& insertItem);//Function to insert an item at the end of the list.//The parameter insertItem specifies the item to be inserted.//Postcondition: list[length] = insertItem; and length++;// If the list is full, an appropriate message is// displayed.void removeAt(int location);//Function to remove the item from the list at the//position specified by location//Postcondition: The list element at list[location] is removed// and length is decremented by 1. If location is out of// range, an appropriate message is displayed.void retrieveAt(int location, elemType& retItem) const;//Function to retrieve the element from the list at the//position specified by location.//Postcondition: retItem = list[location]// If location is out of range, an appropriate message is// displayed.void replaceAt(int location, const elemType& repItem);//Function to replace the elements in the list at the//position specified by location. The item to be replaced//is specified by the parameter repItem.//Postcondition: list[location] = repItem// If location is out of range, an appropriate message is// displayed.void clearList();//Function to remove all the elements from the list.//After this operation, the size of the list is zero.//Postcondition: length = 0;int seqSearch(const elemType& item) const;//Function to search the list for a given item.//Postcondition: If the item is found, returns the location// in the array where the item is found; otherwise,// returns -1.void insert(const elemType& insertItem);//Function to insert the item specified by the parameter//insertItem at the end of the list. However, first the//list is searched to see whether the item to be inserted//is already in the list.//Postcondition: list[length] = insertItem and length++// If the item is already in the list or the list// is full, an appropriate message is displayed.void remove(const elemType& removeItem);//Function to remove an item from the list. The parameter//removeItem specifies the item to be removed.//Postcondition: If removeItem is found in the list,// it is removed from the list and length is// decremented by one.arrayListType(int size = 100);//constructor//Creates an array of the size specified by the//parameter size. The default array size is 100.//Postcondition: The list points to the array, length = 0,// and maxSize = sizearrayListType(const arrayListType& otherList);//copy constructor~arrayListType();//destructor//Deallocates the memory occupied by the array.protected:elemType* list; //array to hold the list elementsint length; //to store the length of the listint maxSize; //to store the maximum size of the list};#endiftemplate bool arrayListType::isEmpty() const{return (length == 0);}template bool arrayListType::isFull() const{return (length == maxSize);}template int arrayListType::listSize() const{return length;}template int arrayListType::maxListSize() const{return maxSize;}template void arrayListType::print() const{for (int i = 0; i < length; i++)cout << list[i] << " ";cout << endl;}template bool arrayListType::isItemAtEqual(int location, const elemType& item) const{return(list[location] == item);}template void arrayListType::insertAt(int location, const elemType& insertItem){if (location < 0 || location >= maxSize)cerr << "The position of the item to be inserted "<< "is out of range" << endl;elseif (length >= maxSize) //list is fullcerr << "Cannot insert in a full list" << endl;else{for (int i = length; i > location; i--)list[i] = list[i - 1]; //move the elements downlist[location] = insertItem; //insert the item at the//specified positionlength++; //increment the length}} //end insertAttemplate void arrayListType::insertEnd(const elemType& insertItem){if (length >= maxSize) //the list is fullcerr << "Cannot insert in a full list" << endl;else{list[length] = insertItem; //insert the item at the endlength++; //increment the length}} //end insertEndtemplate void arrayListType::removeAt(int location){if (location < 0 || location >= length)cerr << "The location of the item to be removed "<< "is out of range" << endl;else{for (int i = location; i < length - 1; i++)list[i] = list[i + 1]; //move the elements uplength--;}} //end removeAttemplate void arrayListType::retrieveAt(int location, elemType& retItem) const{if (location < 0 || location >= length)cerr << "The location of the item to be retrieved is "<< "out of range." << endl;elseretItem = list[location];} //end retrieveAttemplate void arrayListType::replaceAt(int location, const elemType& repItem){if (location < 0 || location >= length)cerr << "The location of the item to be replaced is "<< "out of range." << endl;elselist[location] = repItem;} //end replaceAttemplate void arrayListType::clearList(){length = 0;} //end clearListtemplate int arrayListType::seqSearch(const elemType& item) const{int loc;bool found = false;for (loc = 0; loc < length; loc++)if (list[loc] == item){found = true;break;}if (found)return loc;elsereturn -1;} //end seqSearchtemplate void arrayListType::insert(const elemType& insertItem){int loc;if (length == 0) //list is emptylist[length++] = insertItem; //insert the item and//increment the lengthelse if (length == maxSize)cerr << "Cannot insert in a full list." << endl;else{loc = seqSearch(insertItem);if (loc == -1) //the item to be inserted//does not exist in the listlist[length++] = insertItem;elsecerr << "the item to be inserted is already in "<< "the list. No duplicates are allowed." << endl;}} //end inserttemplatevoid arrayListType::remove(const elemType& removeItem){int loc;if (length == 0)cerr << "Cannot delete from an empty list." << endl;else{loc = seqSearch(removeItem);if (loc != -1) //the item to be removedremoveAt(loc); //exists in the listelsecout << "The item to be deleted is not in the list."<< endl;}} //end removetemplate arrayListType::arrayListType(int size){if (size < 0){cerr << "The array size must be positive. Creating "<< "an array of size 100. " << endl;maxSize = 100;}elsemaxSize = size;length = 0;list = new elemType[maxSize];//assert(list != NULL);}template arrayListType::~arrayListType(){delete[] list;}template arrayListType::arrayListType(const arrayListType& otherList){maxSize = otherList.maxSize;length = otherList.length;list = new elemType[maxSize]; //create the arrayassert(list != NULL); //terminate if unable to allocate//memory spacefor (int j = 0; j < length; j++) //copy otherListlist[j] = otherList.list[j];} //end copy constructortemplate const arrayListType& arrayListType::operator=(const arrayListType& otherList){if (this != &otherList) //avoid self-assignment{delete[] list;maxSize = otherList.maxSize;length = otherList.length;list = new elemType[maxSize]; //create the arrayassert(list != NULL); //if unable to allocate memory//space, terminate the programfor (int i = 0; i < length; i++)list[i] = otherList.list[i];}return *this;}