Make a ADT queue named deque (double-ended queue) so items can be inserted or deleted from either end. Make it a C++ class that implements this ADT. Write a short program to test the ADT. Then show how stack and single-ended queue classes can be descendants of your deque class.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
## Platform
Borland C++ Version 5.02