A dozen stack is a stack with a fixed size of 12 elements. If a dozen stack is full, then the element that has been on the stack, the longest, is removed to make room for a new new element. For this problem, you are required to design a class named DozenStack.java, which extends DozenStackAbstract.java, and implements push method to captures this specification of a dozen stack. 

given

DozenStackAbstract.java

public abstract class DozenStackAbstract{

private Character[] c; private int total; public DozenStackAbstract(){ c=new Character[12]; total=0; } public abstract void push(char c); public boolean isEmpty(){ return total==0; } public boolean isFull(){ return total==12; } public void pop(){ if(total>0) total--; } public Character top(){ if(total>0) return c[total-1]; else return null; } public void updateTotal(int num){ total +=num; } public Character[] getData(){ return c; } public int size(){ return total; }

}