Q4. [20 Marks] (Answer only TWO) A-Explain the following: a. Segmentation b. Portioning B- The following interrupt processes are to be implemented in the processor. Show the time sequence diagram for the multiple interrupts using the nested approach. Note: higher number of (priority) implies higher priority. Time Process Processing time Priority 3 P1 2 3 6 P2 5 1 10 P3 12 23 P4 7 5 2 Q5. [20 Marks] A- Compare pipelined datapath with single-cycle datapath for the store word (sw) instruction. Take into your consideration (Table-Q5). Instruction class Table-Q5 Instruction Register ALU Data fetch read operation access 200 100 200 200 200 100 200 200 200 100 200 Register write 100 Load word (lw) Store word (sw) R-format(add, sub, and, or, slt) Branch (beq) Total time 800 700 600 100 200 100 200 500 B- Assume 0.1% of the runtime of a program is not parallelizable. This program is supposed to run on the Tianhe-2 supercomputer, which consists of 3,120,000 cores. Under the assumption that the program runs at the same speed on all of those cores, and there are no additional overheads, what is the parallel speedup on 30, 30,000 and 3,000,000. Good Luck