help me solve this in java

(Merge two sorted lists)

Write the following method that merges two sortedlists into a new sortedlist.

public static int[] merge(int[] list1, int[] list2)

Implement the method in a way that takes at most list1.length+ list2.length comparisons.

Write a test program that prompts the user to enter two sorted lists and displays the merged list. Note that the first number in the input indicates the number of the elements in the list. This number is not part of the list. (NOTE: Cant use sort() method from Array class.)

Prompt to ask the users to enter the size of thearray, and the content of arrays.

Assignment 1 [Java Application] /Library/Java/JavaVirtual Machi Enter a sorted list1: (start with the size of the list) 4 68 79 100 108 Enter a sorted list2: (start with the size if the list) 3 34 95 290 The list of the merged array with 7 elements: 34 68 79 95 100 108 290 Assignment1 [Java Application] /Library/Java/JavaVirtualMach Enter a sorted list1: (start with the size of the list) 6 10 34 56 65 90 126 Enter a sorted list2: (start with the size if the list) 9 4 8 15 24 40 64 72 98 240 The list of the merged array with 15 elements: 4 8 10 15 24 34 40 56 64 65 72 90 98 126 240