Problem 1: Performance tomato: Instruction Type Arithmetic Logical Loads Stores Conditional branches 3 Unconditional jumpstor alt $to, $al, $a2 Cycles beq sto, szero orange add $t1, $a0, $t1 sll $t2, $a2, 2 add $t2, $a0, $t2 add $t5, $al, $zero andi $ts, $t5, 1 beq $ts, Szero, potato 1 $t3, 0(stll add $t4, $t3 $t3 6 Table 1. Number of clock cycles for each type of instruction sw t4, 0($t1) potato: addi $al, $al, 1 addi $a2, $a2, -1 tomato orange: r Sra Part (a) Above is the assembly code for the function declared as: tomato(int arrayl), int x, int y is an array of 500 integers, and the function is called as tomato(myarray, 4, 22) (0)How many times is the "slt" instruction executed? Justify your answer to receive credit. (6pts) to receive credit. (6 pts)? () How many times is the "lw" instruction executed? Justify your answer 2). Show your work (20 points)? Part (b) Calculate the total number of cycles it takes to execute tomato(myarray, ,2 Problem 1: Performance tomato: Instruction Type Arithmetic Logical Loads Stores Conditional branches 3 Unconditional jumpstor alt $to, $al, $a2 Cycles beq sto, szero orange add $t1, $a0, $t1 sll $t2, $a2, 2 add $t2, $a0, $t2 add $t5, $al, $zero andi $ts, $t5, 1 beq $ts, Szero, potato 1 $t3, 0(stll add $t4, $t3 $t3 6 Table 1. Number of clock cycles for each type of instruction sw t4, 0($t1) potato: addi $al, $al, 1 addi $a2, $a2, -1 tomato orange: r Sra Part (a) Above is the assembly code for the function declared as: tomato(int arrayl), int x, int y is an array of 500 integers, and the function is called as tomato(myarray, 4, 22) (0)How many times is the "slt" instruction executed? Justify your answer to receive credit. (6pts) to receive credit. (6 pts)? () How many times is the "lw" instruction executed? Justify your answer 2). Show your work (20 points)? Part (b) Calculate the total number of cycles it takes to execute tomato(myarray, ,2