Please answer all the questions thank you

[12 points] A dqueue (doubled-ended queue) is a list from which elements can be inserted or deleted at either end. Present a specification (pseudocode) for the dqueue ADT using both array as well as linked-list implementations. Show the operations for enqueue Front (), enqueueRear(), dequeue Front and de queue Rear () for both array and linked-list