Ps P Task 4. Total 10% Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place the following processes (in order)? Process Memory Size Requested 115 KB P2 500 KB 358 KB 200 KB PS 375 KB For each algorithm: . Figure out how each algorithm places these processes in the memory, and then draw the memory map showing the processes in the memory. Indicate which if any requests cannot be satisfied. . Note that each partition can accommodate more than one process. E.g., A 300 KB partition can accommodate three processes with sizes 100 KB, 89 KB and 110 KB in sequence, as these processes (100+80 + 110 = 299 KB) can fit into this 300 KB partition. Comment on how efficiently each of the algorithms manages memory. Task 5. Total 5% Assuming a 4-KB (= 4,096 bytes) page size. Calculate (i) the page number and (ii) the offset for each of the address references (provided as decimal numbers) below. Page 1 (a) 710,312 (b) 50,124 (c) 271,302 (d) 92,151 Show your answers using a table similar to the one below: Address Page Number Offset 710,312