Subject: Operating Systems

Please explain how to solve it. Thank you.

Do the same as above, but this time using a "worst-fit" policy, when memory is freed it is put into the free list so that the free list remains sorted by address value, and coalescing is performed after every free() operation. (1000, 100) ptro alloc(2) (1002,98) ptri alloc(26) (1028,72) free(ptro) = (1000,2) -> (1028,72) Problems 6-10. Continuing execution, write the state of the free list where the question marks appear: ptr2 alloc(24) ? ptr3 = alloc(30) ? free(ptri) ? ptr4 alloc(13) ? ptr5 alloc(13)