Define a min-max queue IN PSEUDOCODE to be a data structure that supports the queue operations of enqueue () and dequeue

[answerhappygod]

Define a min-max queue IN PSEUDOCODE to be a
data structure that supports the queue operations of enqueue () and
dequeue () for objects that come from a total order, as well as
operations min () and max (), which return, but do not delete the
minimum or maximum element in the min-max queue, respectively.
Describe an implementation for a min-max queue that can perform
each of these operations in amortized O (1) time.