Please i need help!

In c++ (is there a better way to write the code for easy understanding? i'm not good at it)

Implement the list abstract data type called arrayList using arrays. Desired functionalities are as follows: Function Constructors Destructors bool isEmpty() const bool isFull ) const int listSize) const int maxListSize ) const void print 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 Checks if the item at position matches the 2nd parameter ool isItemAtEqual(int, elemType) void insertAt(int, elemType) void insertEnd (elemType) void removeAt (int elemType retreiveAt(int) void rep LaceAt(int, elemType void clearList() operator- Inserts 2d 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 using big-O notation. Report it in a file called report.pdf. Include your sources as references in report.pdf. Include the report in the same zip file as the rest of the code. For each method you implement, you should discuss in the report what its complexity is and why. In addition, you can optionally do an experiment where you execute each method in a loop k times and time the overall execution of the loop. Here's an example code for timing