Write a MARIE subroutine that will multiply two numbers by using repeated addition. For example, to multiply 2 × 8, the program would add 8 to itself twice. (If the larger of the two numbers is chosen to be added to itself, the subroutine will run more quickly.)

Your Question: Write a program in MARIE assembler to print “Hello World!”  Define the message as a “C” style NULL terminated string. The program must implement a loop,  like the pseudocode below. str =“Hello World!”   index = 0 while str[index] != 0      output str[index]       index = index + 1   ORG 100 START,  LOAD STR        STORE INDEXLOOP,   LOAD INDEX        ADD ONE        STORE INDEX        LOAD INDEX        ADD STR        STORE X        LOAD X        OUTPUT        JUMP END          JUMP LOOP END,    HALT STR,    HEX 0048        HEX 0065        HEX 006C        HEX 006C        HEX 006F        HEX 0020        HEX 0057        HEX 006F        HEX 0072        HEX 006C        HEX 0064        HEX 0021        HEX 0000 INDEX,  DEC 0ONE,    DEC 1X,      DEC 0 END  START   // it does not print anything, help pls

Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…

Write a MIPS assembly program to find the maximum number among three integers. Ask the user to enter the numbers, save the numbers, and perform the operations. Output the max and min numbers. Your solution should work for all input orders (3, 12, 9) or (3, 9, 12), or (12, 3, 9), etc. Example Enter the first number: 3 Enter the second number: 12 Enter the third number: 9 Output (should be exact) The maximum number is 12 and the minimum number is 3.

Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is big endian and uses two’s complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). Make it fast