Suppose we are given two sorted arrays containing comparable elements (such as integers or strings). Our goal is to design an algorithm that returns a new array containing all items from both arrays in sorted order. The input arrays should remain unmodified. The algorithm should throw an exception given invalid input. For example, suppose we receive as input the arrays [-5, , , 2] and [-1, 2, 3]. The output should be the array [-5, -1, 0, 0, 2, 2, 3]. (a) Write an English description or high-level pseudocode describing an algorithm to perform this task. Note: do NOT submit Java code. We want to see a high-level description of the algorithm, not a low-level one. Please see the following link for more details on what an acceptable response to this question should look like