These are part of same problem. Please solve all faster properly. I do not need that much details. just make sure the right answer.. I just need the correct answer.

You can use shortcuts but please give solve as fast as possible.

I am running Out of time.

PLEASE DO SUPERFASTLY

Question:

2. a) Given Static memory partitions shown in the following picture, Draw diagrams on [6+2] how would each of the first-fit, best-fit, worst-fit algorithms place processes with the space requirement of the processes P1 (146 KB), P2 (425 KB), P3 (240 KB), P4(89 KB) and P5(450 KB) (in order). Which algorithm makes the most effective use of memory? Answer with justification. Memory 320 Partitions: 200 250 KB 450 KB 160 KB 150 KB 600 KB KB KB [4] b) Assume that in a certain situation of paged memory management system page size is 2KB, find the page number and offset for the following logical addresses of 32 bit or references (provide as a decimal number): i) 1085 ii) 30000 iii) 19467 iv) 15385 c) Describe the advantages of paging over segmentation. [3]