You are given the FixedSizeStackInterface interface with some abstract methods. The

ArrayFixedSizeStack class implements this FixedSizeStackInterface, and hence

you must implement the abstract methods in the ArrayFixedSizeStack class $($indicated by

TOD$0$ comments$).$ The method descriptions are given below $-$

void push $(T$ element$)-$ This method places the element at the top of the stack. If the

stack is full, then the element that has been the longest in the stack is removed to make room

for the new element.

ArrayFixedSizeStack$a^{\text{'}}T$