order of length N. On the other hand, Bob has a sorted list of length M. Now, they want to make a sorted list of N+M length in ascending order. However, they are not very good at algorithms. Hence, they asked for your help. Since you are a computer science student, your task is to come up with an efficient algorithm. 1) Find a solution which runs in 0 (nlogn). 2) Come up with a solution which runs in O(n). Input The first line contains an integer N ( 1 <= N <= 10), denoting the length of Alice's sorted list. In the next line, there will be N integers separated by space. The third line contains another integer M ( 1 <= M <= 10), denoting the length of Bob's sorted list. In the next line, there will be M integers separated by space. All the numbers given in the input will fit in a 32-bit signed integer. It is guaranteed that the given lists will be in sorted order. Output: You have to make a sorted list in ascending order from the given lists in ascending order and show the output. Sample Input/Output: Sample Input 1 4 1357 4 2248 Sample Input 2 3 2 10 12 346789 Sample Input 3 4 1234 1 10 Sample Input 4 7 2 3 8 8 10 12 14 1 1 4 5 6 8 13 15 16 Sample Output 1 1 2 2 3 4 5 7 8 Sample Output 2 2 3 4 6 7 8 9 10 12 Sample Output 3 1 2 3 4 10 Sample Output 4 1 1 2 3 4 5 6 8 8 8 10 12 13 14 15 16