Use the following class to implement a recursive method getMinValue(). This method returns the “minimum" value from a list, accoraing to a compare lo method for T (you do not have to implement the...

java

> { private class Node { private T data; private Node next; private Node(T data) { this.data = data; } } private Node head; public Node getHead() { return head; } public void add(T data) { ... not shown ..} public T getMinValue() { /* You must implement this method using recursion */} "/>
Extracted text: Use the following class to implement a recursive method getMinValue(). This method returns the “minimum" value from a list, accoraing to a compare lo method for T (you do not have to implement the compare To method). Assume there is an add method that correctly inserts nodes into a linked list. Do not add any methods to the Node class. Feel free to add any auxiliary non-static methods to the linked list class. public class MyLinkedList > { private class Node { private T data; private Node next; private Node(T data) { this.data = data; } } private Node head; public Node getHead() { return head; } public void add(T data) { ... not shown ..} public T getMinValue() { /* You must implement this method using recursion */}