Consider the dynamic partition allocation method. Assume at some time, there are five free memory partitions of 100KB, 500KB, 200KB, 300KB, AND 600KB(in order), how would the first-fit algorithms place processes of 212KB, 417KB, 112KB, and 426KB(in order)

212KB is allocated to 500KB partition

417KB is allocated to 600KB partition

112KB is allocated to 288KB partition

426KB will wait

Explanation:

The first fit algorithm works by taking up the first available free partition which has a large enough enough space to accommodate it's size ; The 212KB takes up 500KB (it's the next available partition larger Than 212) ; then it leaves a space of (500KB - 212KB = 288KB) ; Then the 417KB takes up the next large enough storage space of 600KB (also leaving 600 - 417 = 183KB) ; the next large enough space for 112KB is the 288KB ; there is no space large enough to accommodate 426KB.

some reiable sites are books that teachers offer you

b.. i believe would be the right one sorry if im wrong.