In this problem you are asked to compare the storage needed to keep track of free memory using a bitmap versus using a linked list. assume the 128-mb memory is allocated in units of n bytes. for the linked list, assume that memory consists of an alternating sequence of segments and holes, each 64 kb. also assume that each node in the linked list needs a 32-bit memory address, a 16-bit length, and a 16-bit next-node field. how many bytes of storage is required for each method? which one is better?