Exercise P-6.35 describes a LeakyStack abstraction. Implement that ADT using a singly linked list for storage.   Design a circular positional list ADT that abstracts a circularly linked list in the...

Exercise P-6.35 describes a LeakyStack abstraction. Implement that ADT

using a

singly

linked list for storage.

Design a circular positional list ADT that abstracts a circularly linked list

in the same way that the positional list ADT abstracts a doubly linked list,

with a notion of a designated “cursor” position within the list.

Modify the DoublyLinkedBase class to include a reverse method that reverses

the order of the list, yet without creating or destroying any nodes.