C++

Coding exercise Implement abstract data type list using arrays. Functionalities desired are as follows: Decide if you need to use any parameters Especially required if you use dynamic memory mana Checks if list is em 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 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- Inserts 2 parameter at position Inserts object to end of the list Removes object at position Retrieves object at position Replaces object at position with 2n 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, Coding exercise Implement abstract data type list using arrays. Functionalities desired are as follows: Decide if you need to use any parameters Especially required if you use dynamic memory mana Checks if list is em 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 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- Inserts 2 parameter at position Inserts object to end of the list Removes object at position Retrieves object at position Replaces object at position with 2n 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