Coding in C++

Use two files main.cpp and linkedListList.h

Template declaration and implementation in linkedListList.h

ALL the Functions given below should Work

What you will learn Implementing linked lists The list ADT Templates Running time analysis Coding exercise Extend the example discussed in class to implement list functionalities using linked lists in a template called linkedListList. Functionalities desired are as follows Description 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) Checks if list is enm 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 2hd 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 void removeAt (int) elemType retreiveAt (int) void replaceAt (int, elemType) void clearList(O operator- What to turn in A zip file containing the linkedListList.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, i.e., the time complexity of your algorithms in big-O notation. Report it in a file called report.pdf. Include your sources as references in report.pdf