Memory Management a. [10%] Consider the following memory of size 4 MB and currently shows the memory allocated by processes (shaded area shows the memory already) below:

Suppose the followings for memory arrives in the following sequence: P1: 200 KB

P2: 30 KB

P3: 500 KB

P4: 32 KB

P5: 640 KB

P6: 300 KB

Determine the partition to be allocated to each process using following memory allocation method: i) Best Fit ii) First Fit iii) Next Fit b. [10%] A computer system uses the Buddy system for its memory Allocation Technique. Assuming the memory is 1 MB and initially unallocated, simulate the following requests and releases, and show the internal fragmentation at each step in the simulation. Sequence of requests and releases: Allocate A (130 KB) Allocate B (500 KB) Allocate C (100 KB) Release A Allocate D (60 KB) Allocate E (120 KB) Allocate F (70 KB) Release D Release C

Pointer Partition Numer 0 1 2 3 4 5 6 7 8 on 10 11 12 13 14 15 13 Size (KB) 32 256 640 64 128 64 32 256 256 512 128 128 256 448 256 128 512