You will execute various memory management techniques on paper: Static Partitioning and Buddy System for partitioning; First-In-First-Out (FIFO), Clock (Second Chance) and Least Recently Used (LRU) policies for replacement. The following names and sizes are defined for the data.

Assume that there is 2 GB of memory available and following access requests arrive in the order they are given for (N, J, K, E, N, A, C, K, G, F, D, E, D, G, L, B, H, A, H, M). Initially the memory is empty.

A	256 MB
B	512 MB
C	256 MB
D	128 MB
E	512 MB
F	64 MB
G	256 MB

H	512 MB
I	256 MB
J	64 MB
K	512 MB
L	128 MB
M	512 MB
N	64 MB

Execute the following partitioningreplacement combinations. For all three alternatives, draw the memory state after each step. You can prepare it by hand or on a computer. Also indicate theoccurrence of any internal / external fragmentation, the number of misses/hits and additional data for replacement policies (e.g. age counters, clock)

1. a) Static partitioning with 4 equal size partitions and FIFO replacement policy

2. b) Buddy System and LRU replacement policy

3. c) Buddy System and Clock replacement policy