IN C++

Main file has been given below

Searching algorithms on sorted arrays Create a new template called sortedarrayList in a file called sortedarrayList.h with the functionalities as follows: Function Constructors Destructors bool isEmpty() const bool isFull() const int listSize() const int maxListSize() const void print() bool insert(elemType) void remove(elemType) void clearList( Description Decide if you need to use any parameters Especially required if you use dynamic memory management Checks if list is empty Checks if list is full Returns the size of the list Returns the maximum possible size of the list Prints the elements of the list on the console Inserts an element into the sorted list Removes element from the list Empties the list Implement binary search on the sortedarrayList data structure as a member function called unsigned int binarySearchIter (elemType element) and unsigned int binarySearchRec (elemType element) that returns the index at which the element is present using iteration and recursion respectively. Searching algorithms on sorted arrays Create a new template called sortedarrayList in a file called sortedarrayList.h with the functionalities as follows: Function Constructors Destructors bool isEmpty() const bool isFull() const int listSize() const int maxListSize() const void print() bool insert(elemType) void remove(elemType) void clearList( Description Decide if you need to use any parameters Especially required if you use dynamic memory management Checks if list is empty Checks if list is full Returns the size of the list Returns the maximum possible size of the list Prints the elements of the list on the console Inserts an element into the sorted list Removes element from the list Empties the list Implement binary search on the sortedarrayList data structure as a member function called unsigned int binarySearchIter (elemType element) and unsigned int binarySearchRec (elemType element) that returns the index at which the element is present using iteration and recursion respectively