Q9 Linked Lists 45 Points Q9.1 25 Points Implement the method tindMen() that finds and returns the minimum value in a linked list Assume the linked list holds only positive values. You may NOT use or implement helper methods - all your code must be implemented inside the given method. You may NOT use recursion public class Nodet public int data; public Node next; ) // Given a front pointer to the first node in the list. // Returns the minimum value among all integers in the list. // Input list could be empty, returns -1 if the given linked list is empty. public static int findMin(Node front) { // COMPLETE THIS METHOD } Enter your answer here Q9.2 5 Points What is Big O notation for the running time of the findin() method in part 9.1? Give your reasoning process. Enter your answer here