I am trying to write a program, in JAVA, that will show the output of the following sequence of queue operations: enqueue(5), enqueue(3),dequeue(),enqueue(2),enqueue(8),dequeue(), dequeue(),enqueue(9),enqueue(1),dequeue(),enqueue(7),enqueue(6), dequeue(),dequeue(),enqueue(4),dequeue(),dequeue(),

RPN.java import java.util.Scanner; /** * Reverse Polish Notation calculator. It evaluates * a string with expressions in RPN format and prints * the results. Exampel of a stack use. */public class RPN{     /**     * Given a string, return an integer version of     * the string. Check if the string contains only     * numbers, if so, then does the conversion. If     * it does not, it reurns 0.     * @param t string with numeric token     * @return int version of the numeric token in t     */    public int getValue(String t)    {        if (t.matches("[0-9]+")) {            return Integer.parseInt(t);        }        else {            return 0;        }    }     /**     * Evaluates a single token in an RPN expression. If it is     * a number, it pushes the token to the stack. If it is an     * operator, then it pulls 2 numbers from the stack, performs     * the operation and pushes back into the stack the result.     * @param token to be evaluated     * @param stack holding values for…

The following describes a fork-join task: What are the differences between RecursiveAction and RecursiveTask, and how do they interact?

complete TODO's using Java