CODED IN C++: In this assignment, you will design, implement, and test the following data structures:

• a List ADT(abstract data type) using a "container class" of ListItem(s)
• a Stack ADT as a derived(inheritor) of the List container class
• a Queue ADT as a derived(inheritor) of the List container clas

You will design, implement, and test a List based reusable class hierarchy. This assignment must be implemented using an object oriented, class based language which supports class INHERITANCE. The List class must support the creation of a doubly linked(versus singularly, or circularly linked) List of "ListItem"(s). Once the doubly linked list is implemented, test the functionality of the List via creation of a "stub" program which generates test reports of the following:

• List class constructors(default, parametized, copy)
• List operations(add, delete, search, sort, iterate)
  • Via the Sort operation of the List, the List maybe unordered or ordered(sorted).
• List destructor(if you dynamically allocate ListItems using "new", you MUST provide a List destructor

Once you have "proven" the correct functionality of the List ADT, use the List as a Base(or Parent) class for sub(derived) classes:

• Stack(add operations Push(item), Pop(), ShowTop() or Peek()
• Queue(adds operations Enqueue(item), deQueue()).

Prove correct functionality of the Stack and Queue classes via a stub program which demonstrates EACH subclass operation(similar to reported tests for List class).