1. There are 5 processes (in order) of A (115 KB), B (500 KB), C (350 KB), D (200 KB), and E (450 KB) need to be placed in the memory. a. Suppose a fixed-partition is used with six memory partitions of 300 KB, 600 KB, 400 KB, 200 KB, 750 KB, and 125 KB (in order). i. How would the best-fit and worst-fit algorithms place the processes? Draw the memory stack and label the partition size clearly. [10m] ii. In terms of process placement in the memory, which algorithm faced a problem? What is the problem and state the cause of the problem. [4m] b. Suppose a variable or dynamic partition is used with the same 5 processes in Question1. The following events happened: t1: process A and D left. t2: process F (50K) enters t3: process B left. t4: process G (550K) enters.