Please use basic java code to solve the following problem:

(Merge two sorted lists) Write the following method that merges two sorted lists into a new sorted list: public static int[] merge(int[] list, int[] list2) Implement the method in a way that takes at most listl.length + list2.length comparisons Write a test program that prompts the user to enter two sorted lists and displays the merged list. Here is a sample run. Note the first number in the input indicates the number of the elements in the list. This number is not part of the list Enter list1 size and contents: 5 1 5 16 61 111 Enter Enter 1ist2 size and contents: 4 2 4 5 6-Enter list1 is 1 5 16 61 111 list2 is 2456 The merged list is 12455 6 16 61 111