In programming language Java

L. Given a pointer to a singly linked list write a routine, which will travel through the list creating a second list by taking every 2nd node from the first list and putting it into the newly created list. (For example: If the original list had 10 nodes it should remain with nodes 1, 3, 5, 7, and 9 while the 2d list would be made up of nodes 2, 4, 6,8, and 10