//JAVA

Design and implement a Min Queue data structure that can store comparable elements and supports the queue operations add(x),remove(), and size(), 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.

//Explain in commends all lines please