Given two, sorted, integer arrays, create a new array equal to the combined size of the two arrays, containing all the values of the initial two arrays in sorted order. Input Format One integer n representing the size of the first array, followed by n integers: the values of the first array. Another integer m representing the size of the second array, followed by m integers: the values of the second array. Constraints The values of m and n (the sizes of the two arrays to be merged) will be between 1 and 1000 The arrays will contain valid java integer values. Output Format display the values of the new array separated by single spaces Sample Input 0 5 10 21 35 43 56 8 18 22 24 29 31 48 49 55 Sample Output 0 10 18 21 22 24 29 31 35 43 48 49 55 56 1 import java.io.*; 2 3 4 5 6- 7▾ 8 9 import java.util.*; public class Solution { Java 8 public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to be named Solution. */ } }

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.