Write a MIPS procedure that takes as its three parameters the starting address of an integer array, and two positive integers low and high, and returns the sum of the low’th through the high’th array elements. For example, for the array 3, 8, -1, 5, 4, 3, 9 and low and high values of 2 and 4, the return value should be 12 (since the sum of the 2nd through the 4th array elements is 8 + -1 + 5 = 12). Also, write a main program to test your procedure. Your main program should input the number of integers n in the array from the user (you may assume that n is at most 25), input the n integers, and then input the integers low and high. Your main program should then invoke your procedure, output the return value, and terminate. Your code must use the “standard” conventions for passing parameters and returning results.

The program below uses pointer arithmetic to determine the size of a 'char'variable. By using pointer arithmetic we can find out the value of 'cp' and thevalue of 'cp+1'. Since cp is a pointer, this addition involves pointer arithmetic:adding one to a pointer makes the pointer point to the next element of the sametype.For a pointer to a char, adding 1 really just means adding 1 to the address, butthis is only because each char is 1 byte.1. Compile and run the program and see what it does.2. Write some code that does pointer arithmetic with a pointer to an int anddetermine how big an int is.3. Same idea – figure out how big a double is, by using pointer arithmetic andprinting out the value of the pointer before and after adding 1.4. What should happen if you added 2 to the pointers from exercises 1through 3, instead of 1? Use your program to verify your answer.#include <stdio.h>int main( ){ char c = 'Z'; char *cp = &c; printf("cp is %p\n", cp); printf("The character at cp is…

Consider two integer arrays B and D of 100 elements. Let X2 and X3 contain the base address of array "B" and "D", respectively, and the index į is in X0, h is in X10. Write LEGV8 code to perform the following operations: (a) Get B[15] from memory and put it in register X5. (b) Put the value 132 in D[6]. (c) Translate the following C code into LEGv8 instructions int j = 50, h; do { D[2*j] = (B[j] + B[j+2])*9 - h; j^j -2; while {j >0}; DO NOT use multiply instruction in your code, use shift instruction for multiplication instead! (d)How many instructions are executed during the running of the code in (c), and how many memory data references are made during executio'n?

in c++ using only binary search