chap lists and arrays revisited add two matrices implement the memmanager adt shown at the beginning of section use separate linked list to implement the freelist your implementation should work for any of the three sequential-fit methodsfirst fitbest fitand worst fit test your system empirically to determine under what conditions each method performs well implement the memmanager adt shown at the beginning of section do not use separate memory for the free listbut instead embed the free list into the memory pool as shown in figure your implementation should work for any of the three sequential-fit methodsfirst fitbest fitand worst fit test your system empirically to determine under what conditions each method performs well implement the memmanager adt shown at the beginning of section using the buddy method of section your system should support requests for blocks of specified size and release of previously requested blocks implement the deutsch-schorr-waite garbage collection algorithm that is illustrated by figure