Computer Science Homework Help

Design and implement aMinQueuedata structure that can store comparable
elements and supports the queue operationsadd(x),remove(), andsize(), as
well as the min() operation, which returns the minimum value currently
stored in the data structure. All operations should run in constant
amortized time.

please see the attached sample file below.