in this question you will consider an 3-wide out of order machine executing the following code: add x3, x3, 0x1 lsl x4, x4, 0x3 add x4, x3, x4 stur x4, [x5, 0 ] add x12, x12, 0x1 lsl x9, x12, 0x3 add x9, x13, x9 ldur x10, [x9, 0] add x7, x7, x10 stur x7, [ x4, 0 ] sub x11, x7, 0 x100 cbnz x11, loop assuming the following, how many cycles would this code take to complete: perfect renaming, forwarding, and bypassing each instruction only takes one cycle to execute
