Problem 3. (Min Max) Implement a library called mink with static methods mino and nax 0 that accept a reference eirat to the first node in a linked list of integer-valued items and return the minimum and the maximum values respectively. import stdlib.StdOut; import stdlib.StdRandom; import stdlib.StdStats; no usages public class MinMax \{ I/ Returns the minimum value in the given linked list. public static int min(Node first) \{ // Set min to the largest integer. // Compare each element in linked list with min and if it is smaller, up I/ Return min. \} // Returns the maximum value in the given linked list. 1 usage public static int max(Node first) f I/ Set max to the smallest integer. I/ Compare each element in linked list with max and if it is larger, update II Set max to the smallest integer. 6A2 1/ Compare each element in linked list with max and if it is larger, update max. I/ Return max. \} II A data type to represent a Linked list. Each node in the List stores an integer item and a 1/ reference to the next node in the List