Using the knowledge in computational language in JAVA it is possible to write a code that organizes the values in descending order according to the division made.
<h3>Writing the code in JAVA we have:</h3>
<em>ArrayStackADT.java</em>
<em>package L4.num1;</em>
<em>public interface ArrayStackADT<T></em>
<em>{</em>
<em>void initializeStack();</em>
<em>boolean isEmptyStack();</em>
<em>boolean isFullStack();</em>
<em>void push(T item) throws StackOverflowException;</em>
<em>T peek() throws StackUnderflowException;</em>
<em>void pop() throws StackUnderflowException ;</em>
<em>}</em>
<em>StackOverflowException.java</em>
<em>package L4.num1;</em>
<em>public class StackOverflowException extends StackException</em>
<em>{</em>
<em>public StackOverflowException()</em>
<em>{</em>
<em>super("Stack Overflow");</em>
<em>}</em>
<em>public StackOverflowException(String message)</em>
<em>{</em>
<em>super(message);</em>
<em>}</em>
<em>}</em>
<em>StackException.java</em>
<em>package L4.num1;</em>
<em>public class StackException extends RuntimeException</em>
<em>{</em>
<em>public StackException(String message)</em>
<em>{</em>
<em>super(message);</em>
<em>}</em>
<em>}</em>
<em>StackUnderflowException.java</em>
<em>package L4.num1;</em>
<em>public class StackUnderflowException extends StackException</em>
<em>{</em>
<em>public StackUnderflowException()</em>
<em>{</em>
<em>super("Stack Underflow");</em>
<em>}</em>
<em>public StackUnderflowException(String message)</em>
<em>{</em>
<em>super(message);</em>
<em>}</em>
<em>}</em>
See more about JAVA at brainly.com/question/12978370
#SPJ1