Description: Write a function Partition (f, l, p, a) //                which partitions array a into two parts, left and right. //                Elements of a in the left part should be smaller than p, //                and the elements of a great than or eqaul to p should be in the right part. //                F should set to the first element of a partition of array a to be partioned, //                and l is the left element of a to be subjected to the partition.   In C++ please, must include partition and swap functions

Define the following function that takes an array of integers to fill it with randomly created integers between the given range. The second argument of the function is the size of the array, "first" is the first value for random integers and "nums" is the number of terms in the given range. (i.e., when first is 10 and nums 35, the range will be between [10-44]) The function also returns the minimum value in this array. int myRandArr(int arr[], int size, int first, int nums); Write the main function to create an array and test your function. For this purpose, create and integer array between the range [-15-15] and display values together with the minimum value. Sample Output: Elements of randomly created array: 4 13 -11 -12 -2 The min of those values: -12

MIPS Assembly  The program: Write a function in MIPS assembly that takes an array of integers and finds local minimum points. i.e., points that if the input entry is smaller than both adjacent entries. The output is an array of the same size of the input array. The output point is 1 if the corresponding input entry is a relative minimum, otherwise 0. (You should ignore the output array's boundary items, set to 0.)  My code: # (Note: The first/last entry of the output array is always 0# since it's ignored, never be a local minimum.)# $a0: The base address of the input array# $a1: The base address of the output array with local minimum points# $a2: Size of arrayfind_local_minima:############################ Part 2: your code begins here ###la $t1, ($t2)la $t1, ($t2)move $a1, $s0 li $a2, 4jal find_local_minima print:ble $a2, 0, exitlw $a0, ($s0)li $v0, 1syscall addi $s0, $s0, 4addi $a2, $a2, -1 ############################ Part 2: your code ends here ###jr $ra I am not getting the correct…