Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 kb, 500 kb, 358 kb, 200 kb, and

375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.

a) first fit:

115 -> 300

500-> 600

358 -> 750

200 -> 350

375 -> not able to allocate

b) best fit:

115 -> 125

500 -> 600

358 -> 750

200 -> 200

375 -> not able to allocate

c) worst fit:

115 -> 750

500 -> 600

358 -> not able to allocate

200 -> 350

375 -> not able to allocate