The recitation problem Merge Two Sorted Arrays (code below) merges the two sorted parameter arrays // nun 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 m + ni public void merge(int[] nunsi, int m, int [] nums2, int n) { int im- 1; int jun. 1; int kmn - 1; while ( 1 ) && 1 > { int one = nums1[1]; int two - nums 2[3]; if ( one >= two ) { numsi[k] - one; K- } else { numsi[k] - two; k; 1.-; } while ( - ) { nunsi[k]. nums 2/3--); } 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 [13,4,6,8). The call would be merge([25.90,0,0,0,0.3. 11.3.4.6,8], 5)

You need to design a circuit that implements the functions in the following table: s0 s1 function0 0 a + 10 1 a – b1 0 a + b1 1 a – 1s0 and s1 are 1-bit control inputs to select the function of the circuit. inputs a and b are 4-bitnumbers in 2s complement form. the output is also a 4-bit number in 2s complement form. you are allowed to use only one ttl 7483 4-bit adder to implement all the functions. but anynumber of other components (except the adder) can be used. hint: design a combinational logic circuit to modify the input b and the “carry input” of theadder depending on the control inputs s0 and s1.important: lab grade will depend on the working of the circuit & will be checked of by your labinstructor.1. is the output valid for the following input combinations: a. s0 = 0, s1 = 0, a = 7, b = 3? b. s0 = 0, s1 = 1, a = 7, b = 3? c. s0 = 1, s1 = 0, a = -4, b = -5? d. s0 = 1, s1 = 1, a = -8, b = 6? 2. what is the range of inputs (for both a and b) that will produce the valid output for all the functions?