Data Structures & Algorithms in Java

Given the following Node object, answer the subsequent questions regarding linked list implementation. public class Node{public lot data; public Node link;} Print the data stored in each node in the linked list. Set the data in the 1001th node to be 60. Insert a new node after the 50th node of the list. The new node should have value 110. Delete the first node encountered which has the data value less than 88 in the list. Return boolean true if found and deleted. Otherwise, return boolean false