*JAVA*

Suppose that you want to add the findMin (but not deleteMin) operation to the Deque repertoire. Implement this class using four stacks. If a deletion empties a stack, you will need to reorganize the remaining items evenly