A deque $($pronounced $$deck$)$ is like a queue, except that items may be added

and removed from both the front and the rear. Write either an array$-$based

$($modify Fig $4\mathrm{.}9$ in the eBook$)$ or linked implementation $($modify Fig $4\mathrm{.}10$ in the

eBook$)$ for the deque