Consider the following LinkedList class. Note the type of each node

s data - this linked list is meant to store only integers! DO NOT assume existence of any other instance variables.

public class LinkedList{

private static vlass Node{

private int dta;

private Node next;

provate Node(int data Node next){

this.data = data;

this.next = next;

}

}

private Node head;

//adds the newData to the back of the list

public void add(int newData){

//code not shown here, but you can assume the method works

}

}

Write the method sumAboveThreshold(int n) for LinkedList. This method should return the sum of all node data that

s greater than n. If no such nodes exist, the method should return 0.

Programming 17 of each node's data- f any other instances (11 pts) Consider the following LinkedList class. Note the type of meant to store only integers! Do not assume the existence of an methods public class LinkedList! private statie class Node/ private int data; private Node next; private Node(int data, Node next) { this.data = data; this.next next; private Node head; // Adds the newData to the back of the list public void add(int newData) { // Code not shown here, but you can assume the method works Write the method sumAbove Thresholdint n) for Linkedlist. This method should return the sum of all node data that's greater than n. If no such nodes exist, the method should return O. Example: If list contains 3, 6, 4, 8 in that order, then calling list.sumAbove Threshold(4) should returns +8 = 14. Calling list.sumAbove Threshoid(8) should return 0