In this lab, you will implement the following methods to manipulate linked lists of integers :
1. Write a method that takes two sorted linked lists, and merges them to produce a single sorted linked list. The parameters to the method will be pointers to the head nodes of the two lists. The return value should be the head node of the merged list.
2. Write a method that takes a linked list and creates another linked list containing the elements of the first list in the reverse order. The method should return the head node of the reversed list.
3. Write a method that divides a given linked list into two lists. The elements of the original list are distributed among the two new lists on the basis of a splitting value. One list will contain all elements less than the splitting value, while the other list will contain all elements greater than the splitting value.