// Memory Manager abstract class class MemManager { public:  

 virtual MemManager() {} // Base destructor  

 // Store a record and return a handle to it virtual MemHandle insert(void* info, int length) =0;  

 // Get back a copy of a stored record virtual int get(void* info, MemHandle h) =0;  

 // Release the space associated with a record  

 virtual void release(MemHandle h) =0; }  

I need and implementation of the MemManager ADT given above. For the implementation, the free list is to be embedded into the memory pool and separate memory is not to be used. Implementation should work for any of the three sequential-fit methods: first fit, best fit, and worst fit.

Finally, I need to test the system empirically to determine under what condition each method performs well.

I would be great if I could get an explanation of the solution at the end which could help me understand the solution better.