By Using C++ Programming language desing and coding the following progaram :

Part 1: Implement and test a fully functional List class. In this part you are required to implement two list classes. Both of these classes shall implement the same List Interface. 1) The first list class shall use an array internally to store the values. It shall automatically allocate a larger array and move all data into the larger array and destroy the old one whenever the list capacity is used up. You list shall never throw an exception even if the internal array gets full but instead it shall seamlessly handle the situation. 2) The second list shall be a linked list implementation. It shall dynamically allocate and link nodes when inserted and remove and destroy them when removed from the list. 3) Both of these classes shall be template classes and they shall be tested using at least two different template types. Part 2: Stack and Queue 1) In this part you are required to implement the Stack and Queue abstract data types (ADT) we discussed in class. Both of these classes shall use your linked list from part one and they shall implement Stack and Queue ADT interfaces respectively. 2) Both of these classes shall be template classes and they shall be tested using at least two different template types. Part 3. Self-Organizing List (SOL) 1) For this part you are required to change your Linked List from the first part so that it becomes self-organizing. 2) Your SOL shall be able to dynamically decide which of the four organization methods to use that we discussed in class. It shall accept a command line argument that indicates the method to be used. 3) You SOL shall be a template class and be tested using at least to different template types. You shall also demo by printing out all values that your SOL indeed keeps the list organized with respect to the chosen method.