Write a Java program $($application$)$ without using the built in linkedlist java class

which given two unsorted lists, merge their nodes together to make one list, by taking nodes alternately between the two lists. For example, if list$1$ contains $[1,5,3]$ and list$2$ contains $[7,13,1]$ then they will be merged into list$3$ which would look like $[1,7,5,13,3,1].$ If either list $($list$1$ or list$2)$ runs out of nodes, then all the nodes in the other list should be added to list. Write a method main to test this method.