Implement your own version of the coalesce() function in C language. coalesce() should detect and remove adjacent free regions in a dynamic memory allocation system. (Evaluates the arguments in order and returns the current value of the first expression that initially doesn't evaluate to NULL)

A traditional free list only contains unused regions of an address space. A modified list may include both used (allocated) and unused regions of the address space. The overhead for maintaining the modified list is the same for both types of regions, and is as follows: typedef structnode_t ( int size; int free struct ode t *next //pointer to next region //size of region //1 free; 0used