solve the attached question class is given template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3 T...

solve the attached question

class is given

template
class ABList{
private:
int max_size;
int actual_size;
T* list_array;
public:
ABList(int Size);
~ABList();
int getLength();

Page 2 of 3

T getItem(int);
void insertItem(T value);
int findAndRemoveItem(T);
void displayList();
void MergeList(ABList);
void ReducetoHalf();
};

Extracted text: Q #1. Apply concepts of Advanced Data Structures to implement a template class for array based list with following attributes and functionalities: template class I> class ABListi private: int max_sise: int actual_sise: I* list_array: public: ABList (int Sise): ABList (): int getlength () : Page 1 of 3 I getItem (int): void insertItem (T value): int findandRemove Item (T) : void displayList (): void Mergelist (ABList): void ReducetoHalf (): Constructor will dynamically allocate the list of size 'Size'. • insertitem() function will insert new item at the end of the list, only if item is not present in the list already. If item is already present, it will display a message, 'Item already in the list. • FindAndRemoveltem) will search an item in the list, if found, item will be removed from the list. If item is not found, function will retum -1. ReducetoHalf) will reduce the size of the List to half and copy all the items from the old list to the new list and destroy the old list. • MergeLists() will combine two array based lists into one. • n main(), define two array based lists of type String and size 10. Ask user to enter 5 names in each of the lists. Merge both the lists and display the resultant merged list on the screen.