Consider the following array: x = [1,2,3,4,5;6,7,8,9,10;11,12,13,14,15;16,17,18,19,20] What Octave command returns the total number of elements in array x?

We have an array variable ‘var’ int var[4] = {25,20,30,40}; Find the memory address of the first element of in the array: var[0]

Q2 You have a dynamic array with 3 elements in it and a capacity of 4. The capacity doubles when additional space is needed and shrinks by 50% (rounding down) when the size is at or below 1/3 capacity. Answer the questions below for the following operation sequence: Add, Add, Remove, Remove, Remove Q2.1 What will be the capacity of the list when the whole sequence is completed? Answer= Enter your answer here

Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length of ARRAY1 is m. ARRAY2[] = [6, 6, 9, 11, 21, 21, 21] Here length of ARRAY2 is n. Array to be returned would be: ARRAY[] = [6, 9, 11, 21] ATTN : Further, please be reminded that you cannot use library functions to either sort and or perform the de-duplication operation. solve the problem in two ways In a separate implementation, code up a solution in such a way that your solution solves the problem with O(nlog(m)) time complexity 2 or O(mlog(n)) time complexity. Here log means to the base of 2. I’m sure you already know that the hint is to use Binary Search. In the form of sentences, as a comment in your code (at the bottom of your Solution2), you are required to suggest how can Solution2 be improved by leveraging the fact that both the arrays are already sorted. Suggest a solution so that your suggested solution can run linearly with O(m + n) time complexity. Your suggestion should be no…