Problem 1 (20 points). Arrange the following branch/jump instructions in descending order of their maximum possible jump target. That is, the instruction that allows the farthest possible jump must go first, followed by the next farthest, and so on. If two instructions allow the same amount of jump, list them in any order. Also state encoding format (R/I/J) and the number of bits used to represent the target address for each instruction. Finally, list for each instruction the maximum distance that can be jumped, both forwards and backwards in memory. j, beq, jr, jal, bne

Problem 2 (10 points). True or false? The immediate constant operand in the addiu instruction is treated as an unsigned 16-bit integer. Give reason(s).

Problem 3 (10 points). Suppose the program counter (PC) is set to 0x40000000. Is it possible to use the jump (j) MIPS assembly instruction to jump directly to the instruction at 0x60000000? If yes, write the corresponding assembly instruction(s). If not, explain why and give other MIPS instruction(s) that can jump to this target address. (For this problem, assume that the instruction memory starts from 0x00000000 and goes to 0xFFFFFFFF.)