Mandatory Instance methods:

public int size$()$

$//$ returns the number of values which are currently in the queue

public boolean isEmpty$()$

$//$ returns true only if there are no values in the queue

public void que$($double value$)$

$//$ add the specified value into the queue

public double deQue$()$

$//$ if the queue is not empty,

$//$ remove and returns the least currently que$$d value in the queue

$//$ otherwise,

$/$ returns Double.NaN

public void queueDump$()$

$//$ print all of the values currenty in the queue, in the order that

$//$ they would be deQue$$d from the queue

Your Class must also work with the following Driver Class StackQueueDriver:

public class StackQueueDriver

$\{$

public static void main$($String$[]$ args$)$

$\{$

Stack myStack $=$ new Stack$()$;

Queue myQueue $=$ new Queue$()$;

System.out.println$("$Filling Stack:"$)$;

double value;

for $($int s $=1$; s $<mtext\; id="EditorElement\_718907"></mtext><mn\; id="EditorElement\_718908">1</mn><mn\; id="EditorElement\_718909">1</mn>$; $++$s$)$

$\{$

value $=$ s $+$ s$/10\mathrm{.}0$;

System.out.println$("\backslash$tpushing $"+$ value$)$;

myStack.push$($value$)$;

$\}$

System.out.println$("$

Stack Dump:"$)$;

myStack.stackDump$()$;

System.out.println$("$

Emptying Stack:"$)$;

while$(!$myStack.isEmpty$())$

$\{$

value $=$ myStack.pop$()$;

System.out.println$("\backslash$tpop $="+$ value$)$;

$\}$

System.out.println$("$

Stack Dump:"$)$;

myStack.stackDump$()$;

System.out.println$("$

A pop too far $="+$ myStack.pop$())$;

System.out.println$("$

$")$;

System.out.println$("$Filling Queue:"$)$;

for $($int q $=1$; q $<mtext\; id="EditorElement\_719390"></mtext><mn\; id="EditorElement\_719391">1</mn><mn\; id="EditorElement\_719392">1</mn>$; $++$q$)$

$\{$

value $=2*$q $+$ q$/10\mathrm{.}0$;

System.out.println$("\backslash$tqueing $"+$ value$)$;

myQueue.que$($value$)$;

$\}$

System.out.println$("$

Queue Dump:"$)$;

myQueue.queueDump$()$;

System.out.println$("$

Emptying Queue:"$)$;

while$(!$myQueue.isEmpty$())$

$\{$

value $=$ myQueue.deQue$()$;

System.out.println$("\backslash$tdeQue $="+$ value$)$;

$\}$

System.out.println$("$

Queue Dump:"$)$;

myQueue.queueDump$()$;

System.out.println$("$

A deQue too far $="+$ myQueue.deQue$())$;

$\}$

$\}$

And produce the following output $($or something equivalent$)$:

Filling Stack:

pushing $1\mathrm{.}1$

pushing $2\mathrm{.}2$

pushing $3\mathrm{.}3$

pushing $4\mathrm{.}4$

pushing $5\mathrm{.}5$

pushing $6\mathrm{.}6$

pushing $7\mathrm{.}7$

pushing $8\mathrm{.}8$

pushing $9\mathrm{.}9$

pushing $11\mathrm{.}0$

Stack Dump:

$11\mathrm{.}0$

$9\mathrm{.}9$

$8\mathrm{.}8$

$7\mathrm{.}7$

$6\mathrm{.}6$

$5\mathrm{.}5$

$4\mathrm{.}4$

$3\mathrm{.}3$

$2\mathrm{.}2$

$1\mathrm{.}1$

Emptying Stack:

pop $=11\mathrm{.}0$

pop $=9\mathrm{.}9$

pop $=8\mathrm{.}8$

pop $=7\mathrm{.}7$

pop $=6\mathrm{.}6$

pop $=5\mathrm{.}5$

pop $=4\mathrm{.}4$

pop $=3\mathrm{.}3$

pop $=2\mathrm{.}2$

pop $=1\mathrm{.}1$

Stack Dump:

A pop too far $=$ NaN

Filling Queue:

queing $2\mathrm{.}1$

queing $4\mathrm{.}2$

queing $6\mathrm{.}3$

queing $8\mathrm{.}4$

queing $10\mathrm{.}5$

queing $12\mathrm{.}6$

queing $14\mathrm{.}7$

queing $16\mathrm{.}8$

queing $18\mathrm{.}9$

queing $21\mathrm{.}0$

Queue Dump:

array.at$(0)=2\mathrm{.}1$

array.at$(1)=4\mathrm{.}2$

array.at$(2)=6\mathrm{.}3$

array.at$(3)=8\mathrm{.}4$

array.at$(4)=10\mathrm{.}5$

array.at$(5)=12\mathrm{.}6$

array.at$(6)=14\mathrm{.}7$

array.at$(7)=16\mathrm{.}8$

array.at$(8)=18\mathrm{.}9$

array.at$(9)=21\mathrm{.}0$

Emptying Queue:

deQue $=2\mathrm{.}1$

deQue $=4\mathrm{.}2$

deQue $=6\mathrm{.}3$

deQue $=8\mathrm{.}4$

deQue $=10\mathrm{.}5$

deQue $=12\mathrm{.}6$

deQue $=14\mathrm{.}7$

deQue $=16\mathrm{.}8$

deQue $=18\mathrm{.}9$

deQue $=21\mathrm{.}0$

Queue Dump:

A deQue too far $=$ Na