I want this question to solve in java.

The array implementation in Introduction to Collections Stacks, keeps the top variable pointing to the next array position above the actual top of the stack. Rewrite the array implementation such that stack[top] is the actual top of the stack. There is a data structure called a dropout stack that behaves like a stack in every respect, except that if the stack size is n, when the n+1 element is pushed, the first element is lost. Implement a dropout stack using an array.

Thanks