A. Consider a system in which dynamic memory consists of 1024K as shown below: Process Memory Area Size [K] 0-63 64 P3 64 - 191 128 192-447 256 P1 448-575 128 576-639 64 P2 640 - 895 256 896 - 1023 128 The process P1, P2, and P3 are already in memory when the processes P4, P5, P6, and P7 arrive in this order. P4, P5, P6, and P7 are of size 64K, 64K, 128K and 32K respectively. Assume that P3 was the last process loaded into memory before P4, P5, P6, and P7. Draw tables, similar to one above, to show how these processes would be placed in memory by the following placement algorithms: a. First Fit b. Worst Fit C. Best Fit