please solve this without using the AI

$2.$ Linked List Exercise:

Create a Java class CustomLinkedList that represents a singly linked list. It should

include methods for adding, removing, and finding elements. Showcase method

overloading by allowing element removal by value and by index.

$$ Node Class: Start by creating a private inner class Node with fields for the data

and a reference to the next node.

$$ Adding Elements: For adding, you can create methods to add at the beginning, at

the end, or at a specific index. Remember to handle special cases, like adding to

an empty list.

$$ Removing Elements: Ensure you correctly adjust the links when removing a node

to maintain the list's integrity. Consider the special case of removing the first or

last node.

$$ Finding Elements: Implement methods to find elements either by their value or

index. This could involve traversing the list until the element is found.

$$ Method Overloading: Show method overloading by implementing different

methods for adding $($e$.$g$.,$ at specific index vs$.$ at the end$)$ and removing elements

$($by index vs$.$ by value$).$

Linked List Exercise: CustomLinkedList Class

public class CustomLinkedList $\{$

private Node head;

private class Node $\{$

int data;

Node next;

Node$($int data$)\{$

this.data $=$ data;

this.next $=$ null;

$\}$

$\}$

$//$ YOUR CODE HERE

$//$ Method for demonstration purposes

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

CustomLinkedList list $=$ new CustomLinkedList$()$;

list.addFirst$(1)$;

list.addLast$(2)$;

list.addFirst$(0)$;

list.removeByValue$(1)$;

$//$ Add more demonstration code as needed

$\}$

$\}$