please i want the full solution for this

PROBLEM-2: Consider the following code fragment to be executed in an 8-stage pipeline machine with Branch is resolved at the end of the 6 th stage. Assume byte addressable memory Answer the following questions. Show your work for each question: i. What is the number of pipeline fill cycles? 21. Explain using RTL notation what happens during the Fetch, Decode, and Execute stages of the BNE instruction? ii. 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 cases: a. If Branch is never taken b. If Branch is taken