solve this question as hurry as you can i Will upvote you sir.

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. 2/4 Memory 200 250 450 160 320 150 6ee Partitions: KB .. KB KB KB 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]