Implement a linked list of integers as a class LinkedList. Build the following methods: ✓ print that prints the content of the linked list; ✓ addFirst that adds a new node to the beginning (the head) of the linked list; ✓ addLast that adds a new node to the end (the tail) of the linked list; ✓ indexOf that finds a specific node by its value, and returns node’s index (node’s position from the left in the linked list); if the value is not present in the linked list, it returns −1; ✓ deleteFirst that deletes the first node in the linked list; ✓ deleteLast that deletes the last node in the linked list. Test your class creating a list in the main and 1) adding one by one nodes 2, 4, 8 to the tail; 2) adding nodes -2, -8 to the head; 3) adding a node 9 to the tail; 4) printing the list; 5) printing indexOf(4); 6) printing contains(9); 7) deleting one by one all the nodes in the list – either from the tail or from the head – and printing the result after each deletion. THEN AFTER THIS Add a new method IN THE FORM OF O(n) reverse to the class LinkedList created in the problem 1. This method must reverse the order of the nodes in the list. For example, having applied reverse to the list [2 → 4 → 8 → 9 → 8], we will change it to [8 → 9 → 8 → 4 → 2].  PLEASE WRITE CODE IN JAVA

Implement a linked list of integers as a
class LinkedList. Build the following methods:
✓ print that prints the content of the linked list;
✓ addFirst that adds a new node to the beginning (the head) of the
linked list;
✓ addLast that adds a new node to the end (the tail) of the linked list;
✓ indexOf that finds a specific node by its value, and returns node’s
index (node’s position from the left in the linked list); if the value
is not present in the linked list, it returns −1;
✓ deleteFirst that deletes the first node in the linked list;
✓ deleteLast that deletes the last node in the linked list.
Test your class creating a list in the main and
1) adding one by one nodes 2, 4, 8 to the tail;
2) adding nodes -2, -8 to the head;
3) adding a node 9 to the tail;
4) printing the list;
5) printing indexOf(4);
6) printing contains(9);
7) deleting one by one all the nodes in the list – either from the tail or
from the head – and printing the result after each deletion.

THEN AFTER THIS

Add a new method IN THE FORM OF O(n) reverse to the class LinkedList created in the problem
1. This method must reverse the order of the nodes in the list. For
example, having applied reverse to the list [2 → 4 → 8 → 9 → 8], we
will change it to [8 → 9 → 8 → 4 → 2]. 

PLEASE WRITE CODE IN JAVA