Integer indexing array: Reverse subsets Construct an indexing array indexArray so that the statement reversedOrder origOrder(indexArray); results in a row array beginning at starting index down to element 1 . Ex: If origOrder is 12, 8,9,15, 3, 44, 23, 25,7,68] and startingValue is 3, then reversedOrder is [9, 8,2]. Row array reversedOrder contains origOrder's element 3, element 2, and element 1 Your Function Save Reset E MATLAB Documentation 1 function reversedorder-CopySubset (startingIndex, origorder) 2% start ingindex: starting index of copied subset indexArray- [1:1:1); % change index values 5 reversedorder-origorder(indexArray) 6 7 end Code to call your function C Reset 1 origorder - [2, 8, 9, 15, 3, 44, 23, 25, 7, 68]; 2 CopySubset (3, origorder)

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

What kind of motivation is katrina showing? use the drop-down menu to complete the statement. katrina is using motivation because she is personally interested in learning more.

Write a program that inserts the digits of an integer into an array in originalorderfollowed by reverse order. first, promptthe user to enter a positive integer(> 0). determine the number of digits of the integer. create a dynamically allocated integer arrayof a size twice the number of digits. now insert the digits in original order which will occupy half of the array. then, insert the digits in reverse order. finally, output thedigits in thearray. use at least two functions to organize your program.