Java

$1.$ Provide a method named removeSecond that will remove the second node from the list if the list contains at least two nodes.

$2.$Given a singlyLinkedList $3->5->24->15->8$ with a head reference refers to node $3.$ Show the linkedlist content after the following operations.

Node curr$=$head.next;

while$($curr$.$next!$=$null$)\{$

curr$=$curr.next;

$\}$

if$($curr$.$item$\%3==0)$ curr.item$=$curr.item$+$head.item;

Node n $=$ new Node$(9,$ curr$)$;

head.next $=$ n;

show the list as: head$->$item$1->$item$2->$item$3....$