enqueue, dequeue, peek, and empty

if the original queue contained a, b, c, d (in this order), reverse() would reorder its contents to d, c, b, a.

Design the algorithm for the reverse method where the queue is implemented with a linked list. [You may only use the methods listed above for the queue class and any methods for the linked list class when designing your algorithm] To do this you will need to employee step-wise refinement.

1. State the abstract solution to the problem,

2. Design an algorithm to implement your solution, and then

3. Convert the algorithm that you designed into pseudocode.