I'm concerned with problem a

c. Discuss how the 32-bit absolute JUMP address is constructed from the 26-bit number in the Mark) 0-25 bits in a MIPS JUMP instruction. a. Obtain the expressions for times taken for sequential and pipelined execution of N tasks using a system with M processing stages with an average time of Tavg at a stage and a maximu time of Tmax and then show that for an ideal pipeline (i.e., one with no stalls) the throughput improvement for infinitely large number of tasks is given by M. Tav Tmax. Marks (2