need some help with this in java Modify the $$LinkedStackOfStrings$.$java$$ program given in the textbook $($program $4\mathrm{.}3\mathrm{.}2)$ by adding a method $$find$()$ that takes a string as an argument. It should return true if the string argument is in the linked stack and false otherwise. $[$MO$6\mathrm{.}1]$

The main method should also be modified so that all the strings $($other than the search string$)$ inputted by the user are stored on the stack before calling the find$()$ method.

Sample runs would be as follows.

$>$java LinkedStackOfStrings hello

this

is a

test run

for the

hello program

hello exists in the linked stack

$>$java LinkedStackOfStrings winter

hello world

is the first program

of any programming

language

winter does not exist in the linked stack public class LinkedStackOfStrings $\{$

private int n; $//$ size of the stack

private Node first; $//$ top of stack

$//$ helper Node class

private class Node $\{$

private String item;

private Node next;

$\}$

$//$ is the stack empty?

public boolean isEmpty$()\{$

return first $==$ null;

$\}$

$//$ number of elements on the stack

public int size$()\{$

return n;

$\}$

$//$ add an element to the stack

public void push$($String item$)\{$

Node oldfirst $=$ first;

first $=$ new Node$()$;

first.item $=$ item;

first.next $=$ oldfirst;

n$++$;

$\}$

$//$ delete and return the most recently added element

public String pop$()\{$

if $($isEmpty$())$ throw new NoSuchElementException$("$stack underflow"$)$;

String item $=$ first.item; $//$ save item to return

first $=$ first.next; $//$ delete first node

n$--$;

return item; $//$ return the saved item

$\}$

$//$ test client

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

LinkedStackOfStrings stack $=$ new LinkedStackOfStrings$()$;

while $(!$StdIn.isEmpty$())\{$

String item $=$ StdIn.readString$()$;

if $(!$item.equals$("-"))$ stack.push$($item$)$;

else if $($stack$.$isEmpty$())$ StdOut.println$("$BAD INPUT"$)$;

else StdOut.print$($stack$.$pop$())$;

$\}$

$\}$

$\}$