Implement a Node class that stores an integer and a LinkedList class that stores nodes of Node.

In the LinkedList class, implement addFrist() in a regular way, and then implement printList() and searchList() using recursion.

The searchList() method searches a pass-in integer number, returns the address of the first node encountered that stores the number, or returns a null if such a node does not exist in the list. Write a test class to test your methods.