2.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

13 Stack Program 4.3.2 Stack of strings (linked list) 575 public class LinkedStackOfStrings private Node first; private class Node private String item; first | first made on list private Node next; item stack item next public boolean isEmpty () next node on list 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 = oldFirst; 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 = new LinkedStackOfStrings(); // See Program 4.3.1 for the test client. This stack implementation uses a private nested class Node as the basis for representing the stack as a linked list of Node objects. The instance variable first refers to the first (most re- cently inserted) Node in the linked list. The next instance variable in each Node refers to the successor Node ( the value of next in the final node is null). No explicit constructors are needed, because Java initializes the instance variables to null. % java LinkedStackOfStrings