Assume there is a 30-byte heap. The free list for this heap has two elements on it. One entry describes the first 10-byte free segment (bytes 0-9), and one entry describes the other free segment (bytes 20-29). Now assume we have a request for just a single byte of memory. In this case, the allocator will perform an action known as________ to find a free chunk of memory that can satisfy the request.

a. splitting
b. coalescing
c. chopping
d. relocating