Write a recursive method to find the largest value in a singly linked list. Create a MyLinkedList .java which inherits from the class LinkedList<String and add the recursive method public String findLargest(). You will need to use the iterator to access each node of the linkedlist. You may need to add a helper method to start the recursion. Use the driver class MyLinkedListDriver.java to populate your linked list and demonstrate that your method works. Add an additional test to MyLinkedListDriver.java.
The largest in the driver class provided is Tom.
Upload your MyLinkedList.java and the modified MyLinkedListDriver.java to Blackboard.
