Write Assembly Language program and show the output after execution to find: The largest and smallest number from an array present in the memory locations 0401-040A and store the Largest number in 040B(Largest No) and 040C(Smallest No). Note: numbers in the array are storied in Hexadecimal =  [67H,32H,6FH,57H,22H,16H,08H,49H,78H

Please your code should be in mips assembly language

Write the ARM code to do C = AB and D = BA with these arrays:  You can have the input arrays, output array, and scalar in either memory or registers. Please help me thanks.

Comment on each snippet with what the snippet does. Assume that there is an array, int arr [6] = {3, 1, 4, 1, 5, 9}, which starts at memory address 0xBFFFFF00. You may assume that each integer is stored in 4 bytes. Register a0 contains arr's address   lw   t0, 0(a0) lw   t1, 8(a0) add t2, t0, t1 sw   t2, 4(a0) 2. add      t0, x0, x0 loop:      slti t1, t0, 6 beq      t1, x0, end slli     t2, t0, 2 add      t3, a0, t2 lw             t4, 0(t3) sub      t4, x0, t4 sw             t4, 0(t3) addi     t0, t0, 1 j        loop end: pseudo-instructions are not allowed

Write the following C code in MIPS assembly, assume that all of result, in1 and in2 arrays are of double type, also assume var is a double type constant. for( i=0, i<100, i++) result[i] = in1[i]*in2[i] + var; %3D Also explain it well . Thank you!!

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?

Design an Algorithm using pseudocode to eventually be implemented in Assembly that accomplishes the following:    Find the mean value of an n-element array within memory that contains numerical values. From the original array, sort all values that are lower than the mean, in sequential order from lowest to highest in a new array From the original array, sort all values that are greater than or equal to the mean, in sequential order from highest to lowest in another new array.Output all the original array and both of the new arrays to the screen.

Computer organisation ! Use RARS simulator to write and execute the two codes below using RISC-V Assembly language.