$1.$ Write a queue client, "LineNum," that takes an integer command line argument $$n$$ and prints the nth string from the first string found on standard input. $[$MO$6\mathrm{.}2]$

Please note that you should use an object of the Queue class given in the textbook $($program $4\mathrm{.}3\mathrm{.}6)$ to implement it$.$ You should add the strings inputted by the user to a queue using the enqueue method. After the user has finished inputting strings $($and they've been added to the queue$)$ you should remove $"$n$"$ strings from the queue by calling the dequeue method $($which would also return the string that is removed from the queue$)$ n times. The string that is returned by the dequeue method when it is called the nth time should then be printed out.

Sample runs would be as follows.

$>$java LineNum $2$

apple

save

that

is

too

me

$2$ from the first is save

$//$Program $4\mathrm{.}3\mathrm{.}6$

public class queue $\{$

private Node first;

private Node last;

private class Node$\{$

private Item item;

private Node next;

$\}$

public boolean isEmpty$()$

$\{$ return $($first$==$null$)$;$\}$

public void enqueue$($Item item$)$

$\{$

Node oldLast $=$ last;

last$=$ new Node$()$;

last.item $=$ item;

last.next $=$ null;

if $($isEmpty$())$ first $=$ last;

oldLast.next $=$ last;

$\}$

public Item dequeue$()\{$

Item item $=$ first.item;

first $=$ first.next;

if $($isEmpty$())$ last $=$ null; return item;

$\}$

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

$\{$

queue queue $=$ new Queue$()$;

$\}$

$\}$