Modern operating system Topic - Memory Management Please answer according to the given value. Don't simply copy other chegg answer!!!

1. Imagine you have a free main memory with the total size 2000KB where 300KB already been used by operating system. Then there are 5 processes (1 00K, 500K, 200K, 500K and 100K in order sequence) are been swap in (fetch in) into the main memory using the dynamic partition placement algorithm. After that, the first 500K process and the second 500K process are been swap out/fetch out (in order). a. Draw these memory partitions in block after the last process been swap out. (8 Marks) b. Perform the following algorithm for the processes of 390K, 90K, 112K and 256K (in order). Continue on based from question 1(a). i First-Fit (4 Marks) ii. Best-Fit (4 Marks) ii. Worst-Fit (4 Marks) iv. Next-fit (4 Marks) C. Among these 4 algorithms, evaluate which algorithm makes the efficient of memory management? Justify your answer accordingly. (3 Marks) d. From answers in 1(b), please state which are them (First-Fit, Best-Fit, Worst-Fit or Next-Fit) produced the same outcome of the memory partitioning? (2Marks)