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

Current file:

LabProgram.java

import java.util.Scanner;

public class LabProgram { /* TODO: Write recursive printLinkedList() method here. */ public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int size; int value; size = scnr.nextInt(); value = scnr.nextInt(); IntNode headNode = new IntNode(value); // Make head node as the first node IntNode lastNode = headNode; // Node to add after IntNode newNode = null; // Node to create // Insert the second and the rest of the nodes for (int n = 0; n

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

Current file:

IntNode.java

public class IntNode { int dataVal; private IntNode nextNodeRef; // Reference to the next node // Constructor public IntNode(int value) { this.dataVal = value; this.nextNodeRef = null; } // Insert a new node after the current node public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodeRef; this.nextNodeRef = nodeLoc; nodeLoc.nextNodeRef = tmpNext; } // Get location pointed by nextNodeRef public IntNode getNext() { return this.nextNodeRef; } // Print the node's data public void printData() { System.out.printf("%d, ", this.dataVal); } } -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Write a recursive method ca led printLinkedListi) that cutputs the integer value of each node in a linked list Methoc printLinioedList(?) has one parameter, the heod node of a list. The main program reads the sze of the linked list, followed by the values in the list, Asssume the linked list has at least 1 node. Ex If the input of the program is: the output of the printLinked Listo) method is: 1,2,3,4,5, Hint: Cutput the value of the cument node, then call the printLinkedList0 method repeatedly until the end of the list is reached. Refer to the IntNode class to explcre any awailable member methods that can be used for implementing the printL inkedl isto method