In this task, you will be asked to complete the public void merge(LinkedList list2) method, which can merge the given linked list into the current list. The list2 will always be either the same size, or shorter than the current list. Tip: we can visit two linkedlists together, and then connect their nodes in turn. This processing should end until the tail node of list2 is visited. Example: * * * * * * List: 1 - 2 - 3 List2: 4 -> 5 -> 6 Return: 1 > 4 -> 2 -> 5 -> 3 -> 6 List: 1 - 2 - 3 -> 4 List2: 5 -> 6 Return 1 -> 5 -> 2 -> 6 -> 3 -> 4