PROBLEM-3: Consider the following code fragment to be executed in an 8-stage pipeline machine with resolved at the end of the 6th stage. Assume byte addressable memory PC address in hexadecimal 00A XOR 008 Instruction PROC AQU XY . 100 102 BNE R1, R2, +8 120 122 INT 21 ENDP Answer the following questions. Show your work for each question: 1. What is the number of pipeline fill cycles? . Explain using RTL notation what happens during the Fetch, Decode, and Ex the BNE instruction? ili. How many cycles could be the branch penalty? iv. Calculate the Branch target address, In decimal? v. Calculate the CPI when executing the above code, for the following two a. If Branch is never taken b. If Branch is taken