3. 10 ptsl Memory management (Basic, no MMU) The total memory available for processes is 10 KB, processes remain in memory until they terminate, they can not be moved. Memory starts at location 0 Assume 4 cores can run processes concurrently (that eans - Scheduler is first-come-first-served, if memory available, and a process can run immediately, if it fits.) For each of the following methods show what memory locations are occupied, in order. (for example, at time 0 until 3, memory blocks 0 through 8 contains process 1, and memory blocks 9 through 10 contains process 2, then at time 2... ) PO P8 You may draw Proccs rva Menory unnng Prioriy ine Size ine pictP7 ure, such as (example): BK 2R 3K 2K Time 0,1,2 3,4 here arrival tine and running tine are in seconds, and nenory size in K Bytes If appropriate, the tie quantum -1 second. Jover Priority values are igher priority Priority 2 is more important than priority 3.1 For the table in question 2: (a) Two equal sized, fixed partitions (a) Two partitions, one is 8K, the other is 2K. (b) First fit. (c) Best fit