Q2 Arrays 10 Points The recitation problem Merge Two Sorted Arrays (code below) merges the two sorted parameter arrays. // num and num2 are integer arrays that are already sorted in increasing order. m and n are the number of items in the arrays, respectively. // numi length is min public void merge(int[] numsi, int m, int [] nums2, int n) { int im. 1; int j - n. 1; int kmn - 1; while ( i >= 2 && j > ) { int one-numsi(1) int two - nums2); if ( one >= two ) { numsi[k] - one; k; } else { numsi[k] - two; --; } while ( - ) { numsi[k--) - nums2[j--); } ) Assuming that . (first array number of items) is 3 and n (second array number of items) is 5 give one example of the best-case scenario, where merge executes the least number of if- conditional to merge the two arrays. For example, one example of the worst-case scenario is when the first array is [2,5,9,0,0,0,0,0] and the second array is [1,3,4,6,8). The call would be merge(2,5,9,0,0,0,0,0], 3, (1,3,4,6,8], 5) Enter your answer here