$2.$

cycles.

$($i$)($ii$)$In the conventional fully bypassed $5-$stage pipeline discussed in class, we were able to make the assumption that$$the ALU is able to complete in one cycle because we assumed integer operations, For this problem, we will assume$$that the ALU takes two cycles to complete. In other words, the ALU is pipelined itself, making the entire pipeline $6$The ALU only generates a result after $2$ cycles $($i$.$e$.,$ there is no way to extract any meaningful result after the$$ALU$\text{'}$s first cycle$).$ Memory $($instruction and data$)$ still returns data after only one cycle. You may ignore branch and$$jump instructions in this problem.