In Java

// CustomLinkedList.java

public class CustomLinkedList { public static int findMax(IntNode headObj) { int max = -1; if (headObj!=null){ max = headObj.getNodeData(); IntNode temp = headObj.getNext(); while(temp !=null){ if(max

------------------------------------------------------

//IntNode.java

public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node

public IntNode() { dataVal = 0; nextNodePtr = null; }

// Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; }

// Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; }

/* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext;

tmpNext = this.nextNodePtr; this.nextNodePtr = nodeLoc; nodeLoc.nextNodePtr = tmpNext; }

// Get location pointed by nextNodePtr public IntNode getNext() { return this.nextNodePtr; }

// Get node value public int getNodeData() { return this.dataVal; } // Print node value public void printNodeData() { System.out.println(this.dataVal); } }

Given the IntNode class, define the findMax() method in the CustomLinkedList class that returns the largest value in the list or returns -99 if the list is empty. Assume all values in the list are non-negative. Ex: If the list contains: head14->191186->181 findMax(headObj) returns 191 . Ex: If the list contains: head ->