Implement the deque from Programming Project 5.6 using links. Each node will need a next reference and a previous reference.

Programming project 5.6

A data structure called a deque is closely related to a queue. The name deque stands for “double-ended queue.” The difference between the two is that with a deque, you can insert, remove, or view from either end of the queue. Implement a deque using arrays.