Modify the LinkedStackOfStrings.java program given in the textbook (program 4.3.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. [MO6.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

m 4.3.2 Stack of strings (linked list) public class LinkedStackofStrings private Node first; private class Node first first n private String item; private Node next; item stack next next public boolean isEmpty ) return (first-null); public void push (String item) // Insert a new node at the beginning of the list. Node oldFirst first; first = new Node(); first.item item; first . next 01 d First; public String pop) // Remove the first node from the list and return item. String item first.item; first first.next; return item; public static void main(String[] args) LinkedStackOfStrings stack // See Program 4.3.1 for the test client = new LinkedStackofStrings(); cent us a linked list of Node objects. The instance variable first refers to the first (mos enily inserted) Node in the linked list. The next instance variable in each Node refers to s st ack implementation uses a private nested class Node as the basis for representing bease r Mode the value of next in the final node is nu11). No explicit constructors are ne ecause Java initializes the instance variables to null