Assume that A and B are equal-length integer arrays. They are both defined in data segment...

Transcribed Image Text:

Assume that A and B are equal-length integer arrays. They are both defined in data segment with labels ArrayA and ArrayB. Also assume that their size is defined in data segment with the label SizeN. Write a piece of code that starting at index 0, searches for the first occurrence of the case, where both A/i] and B[i] are 0 and saves that index in a memory location already defined as Result. If such case does not exist, the result will be equal to SizeN. For the following example Result will be 3. A 1 -2 0 0 2 B 6 0 1 0 2 Make sure your code does not access memory locations outside the boundary of the arrays. With the exception of li, la and move, you should use the MIPS core instruction set only. For this question, you are NOT responsible for saving registers to stack before using them and can freely use any register. Make sure to comment your code sufficiently. Assume that A and B are equal-length integer arrays. They are both defined in data segment with labels ArrayA and ArrayB. Also assume that their size is defined in data segment with the label SizeN. Write a piece of code that starting at index 0, searches for the first occurrence of the case, where both A/i] and B[i] are 0 and saves that index in a memory location already defined as Result. If such case does not exist, the result will be equal to SizeN. For the following example Result will be 3. A 1 -2 0 0 2 B 6 0 1 0 2 Make sure your code does not access memory locations outside the boundary of the arrays. With the exception of li, la and move, you should use the MIPS core instruction set only. For this question, you are NOT responsible for saving registers to stack before using them and can freely use any register. Make sure to comment your code sufficiently.