Tutorial 2: Array Based List List: A collection of elements of the same type. The length of a list is the number of elements in the list. Following are some of the operations performed on a list: 1. Create the list. The list is initialized to an empty state. 2. Determine whether the list is empty. 3. Determine whether the list is full. 4. Find the size of the list. S. Destroy, or clear, the list. 6. Determine whether an item is the same as a given list element. 7. Insert an item in the list at the specified location. 8. Remove an item from the list at the specified location. 9. Replace an item at the specified location with another item. 10. Retrieve an item from the list from the specified location. 11. Search the list for a given item. arrayList Type #list: elemType #length: int #maxSize: int tisEmpty() const: bool +is Full() const: bool +listSize() const: int +maxListSize() const: int +print() const: void +isItemAtEqual (int, const elemType&) const: bool +insertAt(int,const elemType): void +insert End (const elem Type): void +removeAt (int) : void +retrieveAt (int, elem Types) const: void +replaceAt(int, const elemType&): void +clearList(): void +seqsearch (const elemType) const: int +insert (const elemType&): void +remove (const elemType): void tarrayListType (int = 100) +arrayListType (const arrayListType6) +-arrayListType() +operator-(const arrayList TypecelemType>6): const arrayListType Tutorial 2: Array Based List List: A collection of elements of the same type. The length of a list is the number of elements in the list. Following are some of the operations performed on a list: 1. Create the list. The list is initialized to an empty state. 2. Determine whether the list is empty. 3. Determine whether the list is full. 4. Find the size of the list. S. Destroy, or clear, the list. 6. Determine whether an item is the same as a given list element. 7. Insert an item in the list at the specified location. 8. Remove an item from the list at the specified location. 9. Replace an item at the specified location with another item. 10. Retrieve an item from the list from the specified location. 11. Search the list for a given item. arrayList Type #list: elemType #length: int #maxSize: int tisEmpty() const: bool +is Full() const: bool +listSize() const: int +maxListSize() const: int +print() const: void +isItemAtEqual (int, const elemType&) const: bool +insertAt(int,const elemType): void +insert End (const elem Type): void +removeAt (int) : void +retrieveAt (int, elem Types) const: void +replaceAt(int, const elemType&): void +clearList(): void +seqsearch (const elemType) const: int +insert (const elemType&): void +remove (const elemType): void tarrayListType (int = 100) +arrayListType (const arrayListType6) +-arrayListType() +operator-(const arrayList TypecelemType>6): const arrayListType