Dynamic memory management: a dynamic memory allocator uses a linked list to track free
blocks. suppose that the free list contains just two blocks, of size 24 and 16 bytes, in that
order. ignore any space required for bookkeeping overhead.
(a) list a sequence of malloc( ) calls that would succeed using first-fit allocation, but fail
with best-fit, or explain why such a sequence cannot exist.
(b) list a sequence of malloc( ) calls that would succeed using best-bit, but fail with first-fit,
or explain why such a sequence cannot exist.
(c) list a sequence of malloc( ) calls that would succeed on the original free list, with free
blocks of size 24 and 16, using worst-fit, but fail with first-fit, or explain why such a
sequence cannot exist.