Using java and data structure solve. 

you learned how to merge two sorted lists and get a third list which is also sorted. Write a method named mergeUnsortedLists in an application, which given two unsorted lists list1 and list2, merge their nodes together to make one new list list3, by taking nodes alternately between the two lists. For example, if list1 contains [1, 5, 3] and list2 contains [7, 13, 11, 8, 10] then they will be merged into list3 which would look like [1, 7, 5, 13, 3, 11, 8, 10]. Note that if either list (list1 or list2) runs out of nodes, then all the nodes in the other list should be added to list3. Write a main method to test this method. The header of the method is given below. public static LinkedList mergeUnsortedLists (LinkedList listl, LinkedList list2) { you learned how to merge two sorted lists and get a third list which is also sorted. Write a method named mergeUnsortedLists in an application, which given two unsorted lists list1 and list2, merge their nodes together to make one new list list3, by taking nodes alternately between the two lists. For example, if list1 contains [1, 5, 3] and list2 contains [7, 13, 11, 8, 10] then they will be merged into list3 which would look like [1, 7, 5, 13, 3, 11, 8, 10]. Note that if either list (list1 or list2) runs out of nodes, then all the nodes in the other list should be added to list3. Write a main method to test this method. The header of the method is given below. public static LinkedList mergeUnsortedLists (LinkedList listl, LinkedList list2) {