Do whatever you can, you don't need the exact correct answer!

1. Suppose you have designed a processor that goes through the following SIX stages when executing the instruction that takes the maximum time. The times of every stage (in ps) is also shown below: IF 100 ID 50 RR 150 EXE 200 MEM 200 WB 150 Consider the following piece of code: addi $so, $0,10 add $81, $0, $0 loop: beq $so, $0, exit add $81, $s1, $so addi $50, $50,-1 j loop exit: Calculate the time taken to execute this code in a single cycle implementation. Hints: Find out the clock cycle time (Tc) of the single cycle datapath. Count how many instructions are being executed. Note that there is a loop, so some instructions will be executed multiple times. [4] 2. Suppose you have a single-word cache containing 16 blocks. Each memory address is represented as 6 bits. Find out whether the following memory accesses will be hits/misses. Also show the final state of the cache. [6] 22, 46, 27, 48, 19, 22