Implement the following memory allocation method developed by W. A. Wulf, C. B. Weinstock, and C. B. Johnsson (Standish, 1980) called the quick-fit method. For an experimentally found number n of the...

Implement the following memory allocation method developed by W. A. Wulf, C. B. Weinstock, and C. B. Johnsson (Standish, 1980) called the quick-fit method. For an experimentally found number n of the most frequently requested sizes of blocks, this method uses an array avail of n + 1 cells, each cell i pointing to a linked list of blocks of size i. The last cell (n + 1) refers to a block of other less frequently needed sizes. It may also be a reference to a linked list, but because of possibly a large number of such blocks, another organization is recommended, such as a binary search tree. Write methods to allocate and deallocate blocks. If a block is returned, coalesce it with its neighbors. To test your program, randomly generate sizes of blocks to be allocated from memory simulated by an array whose size is a power of 2.