Task$-1$:

Write the following method in Java:

public void reverse$()$

The method will reverse the linked list. Head will point to the last node of the linked list and all the pointers $($addresses$)$ will be reversed. The last node $($a new head$)$ will point to the second last node and so on$.$ The old head node will become the tail node in the reversed LinkedList.

Use the LinkedList class discussed in the video lecture and write the reverse$()$ method in the same class.

Test your method in the main method.

Following picture depicts the reversal of the LinkedList.