Objective: Implement a Singly Linked List in Java that supports the following operations:

Inserting a node at the beginning of the list.

Inserting a node at the end of the list.

Removing a node from the beginning of the list

Removing a node from the end of the list

Displaying all elements in the list.

Instructions:

Create a class Node that represents a node in the linked list. Each node should have:

An integer data field to store the value. A next pointer to refer to the next node in the list.

Create a class SinglyLinkedList that contains the following methods:

insertAtBeginning$($int data$)$: Insert a node with the given data at the beginning of the list. insertAtEnd$($int data$)$: Insert a node with the given data at the end of the list. removeFromBeginning$()$: Remove the node at the beginning of the list. removeFromEnd$()$: Remove the node at the end of the list. display$()$: Display all elements in the linked list from head to tail.

In the main$()$ method of the class, implement a test case that performs the following operations:

Insert at least $3$ elements at the end of the list. Insert $2$ elements at the beginning of the list. Remove $1$ element from the top Remove $1$ element from the end

Display the entire list after each insertion.