3. (5 points) Assume the following definition for a node of a doubly linked list. public class Node { public int data; public Node next; public Node prev; publis Node (int d) { data = d; next = null; prev = null; } (a) (3 points) Write an iterative function findMax () which finds and returns the largest of all the integer data values stored in the linked list. The tail of the list is given as a parameter. public static int findMax (Node tail) { (b) (2 points) Write a recursive function findMaxR() which finds and returns the largest of all the integer data values stored in the linked list. The tail of the list is given as a parameter. public static int findMaxR (Node tail) { Www