Two separate systems one implemented in bitmap and another in linked list to manage the fragmentation of 256 MB memory. For bitmap, allocation units are of 512 bytes. For linked list, each holes or segments are of 32 KB, and each node in the list needs a 32 bits. How many bytes of storage is required for each method? Which one is better in terms of memory spare required?​