IN JAVA $**7\mathrm{.}3$I $($Merge two sorted lists$)$ Write the following method that merges two sorted lists

into a new sorted list.

pub$1$ic static int$[]$ merge$($int$[]1$ist$1,$ int$[]1$ist$2)$

Implement the method in a way that takes at most $1$ist$1\mathrm{.}1$ength $+1$ ist$2.$

$1$ength 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 that the first

number in the input indicates the number of the elements in the list. This number

is not part of the list.

Enter $1$ist$1$: $5151661111$

Enter list$2$: $42456$ HEnter

The merged list is $1245561661111$