Assume a heap with header and footer tags. Free blocks are managed using an implicit free list.

A. Mark the heap blocks in the original heap (before freeing) and visually indicate which blocks are free and which are allocated.

B. Draw the heap after freeing block 0x138. Mark allocated blocks. Fill in only values that have changed.
 

Before free(0x138) After free(0x138) Address (hex) Address (hex) Heap Heap 0x100 13 0x100 0x104 14 0x104 0x108 13 0x108 0x10c 12 0x10c 0x110 12 0x110 Ox114 12 0x114 0x118 13 0x118 0x11c 12 0x11c 0x120 13 0x120 0x124 16 0x124 0x128 17 0x128 0x12c 18 free(0x138) 0x12c 0x130 16 0x130 0x134 17 0x134 0x138 19 0x138 0x13c 18 0x13c 0x140 17 0x140 0x144 16 0x144 0x148 15 0x148 0x14c 14 0x14c 0x150 16 0x150 0x154 0 0x154