Chapter 7, Problem 7.31PE

(Merge two sorted Lists) Write the following method that merges two sorted lists into a new sorted list:

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

Implement the method in a way that takes at most list 1. length + list2.

length comparisons. See liveexample.pearsoncmg.com/dsanimation/ MergeSortNeweBook.html for an animation of the implementation. 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.