write memory manager allocation and deallocation routines for the situation where all requests and releases follow last-requestedfirst-released (stackorder write memory manager allocation and deallocation routines for the situation where all requests and releases follow last-requestedlast-released (queueorder show the result of allocating the following blocks from memory pool of size using first fit for each series of block requests state if given request cannot be satisfied (atake (call this block )take release atake take (btake (call this block )take release atake take (ctake (call this block )take release atake take show the result of allocating the following blocks from memory pool of size using best fit for each series of block requests state if given request cannot be satisfied (atake (call this block )take release atake take (btake (call this block )take release atake take (ctake (call this block )take release atake take show the result of allocating the following blocks from memory pool of size using worst fit for each series of block requests state if given request cannot be satisfied (atake (call this block )take release atake take (btake (call this block )take release atake take (ctake (call this block )take release atake take assume that the memory pool contains three blocks of free storage their sizes are and give examples of storage requests for which (afirst-fit allocation will workbut not best fit or worst fit (bbest-fit allocation will workbut not first fit or worst fit (cworst-fit allocation will workbut not first fit or best fit projects implement the sparse matrix representation of section your implementation should support the following operations on the matrixinsert an element at given positiondelete an element from given positionreturn the value of the element at given positiontake the transpose of matrixand