$1.$ Create a singly linked list.

$2.$ Implement methods to insert nodes, delete nodes, and traverse the list.

$3.$ Complete the skeleton code where needed in the TODOs

class SinglyLinkedList $\{$

$//$Node class to represent each node in the list

class Node $\{$

int data;

Node next;

Node$($int data$)\{$

this.data $=$ data;

this.next $=$ null;

$\}$

$\}$

private Node head $=$ null;

$//$Method to insert a node at the end

public void insertAtEnd$($int data$)\{$

Node newNode $=$ new Node$($data$)$;

if $($head $==$ null$)\{$

head $=$ newNode;

$\}$ else $\{$

Node current $=$ head;

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

current $=$ current.next;

$\}$

current.next $=$ newNode;

$\}$

$\}$

$//$Method to insert a node at the beginning

public void insertAtBeginning$($int data$)\{$

Node newNode $=$ new Node$($data$)$;

newNode.next $=$ head;

head $=$ newNode;

$\}$

$//$TODO: Method to delete a node with a specific value

public void deleteByValue$($int data$)\{$

$//$ Implement the deletion logic

$\}$

$//$TODO: Method to traverse and display the list

public void displayList$()\{$

$//$ Implement traversal and display logic

$\}$

public static void main$($String$[]$ args$)\{$

SinglyLinkedList sll $=$ new SinglyLinkedList$()$;

$//$Insert nodes at the end

sll$.$insertAtEnd$(10)$;

sll$.$insertAtEnd$(20)$;

sll$.$insertAtEnd$(30)$;

$//$Insert nodes at the beginning

sll$.$insertAtBeginning$(5)$;

$//$Display the list

sll$.$displayList$()$; $//$Expected Output: $5102030$

$//$TODO: Delete a node and display the list again

sll$.$deleteByValue$(20)$;

sll$.$displayList$()$; $//$Expected Output: $51030$

$\}$

$\}$