CODING in C++

Lab 3- Arrays Implementing Lists using Arrays What you will learrn Implementing arrays Implementing list ADT using templates Running time analysis Coding exercise Implement abstract data type list using arrays. Functionalities desired are as follows Function Constructors Destructors bool isEmpty() const bool isFull() const int listSize() const int maxListSize() const void print() bool isItemAtEqual(int, elemType) Checks if the item at position matches the 2nd parameter void insertAt (int, elemType) void insertEnd(elemType) void removeAt (int) elemType retreiveAt(int) void replaceAt(int, elemType) void clearList() operator= Description Decide if you need to use any parameters Especially required if you use dynamic memory management Checks if list is empt 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 2nd parameter at position Inserts object to end of the list Removes object at position Retrieves object at position Replaces object at position with 2nd parameter Empties the list Overload the assignment operator Here, elemType is the type of the members of the list. In a given list, all elements are of the same type You should use template implementation to enable functionality to have lists storing different types of objects dynamically What to turn in A zip file containing the arrayList.h file with your template declaration and implementation, and a main.cpp file with test cases to show that your program works For each function, analyze the running time of your algorithm. Report it in a file called report.pdf. Include your sources as references in report.pdf