Given memory partitions in order as: P1: 100k, P2: 500k, P3: 800k, P4: 300k, P5: 600k. How would WORST FIT algorithms place processes(in order) requiring sizes respectively: 212k, 417k, 112k, and 426k?
NOTE: The space left after filling the hole is not used by any other process.
1
P3, P5, P3, P2
2
P2, P5, P3, 426k waits
3
P3, P5, P2, 426k waits
4
P4, P2, P5, P3