In Java, Design and implement a MinStack data structure that can store comparable elements and supports the stack operations push(x), pop(), 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 time. Please make sure provide size() method and run in constant time for min() method!! I will give thumbs up if program run!