Assume that you have 64 MB memory which is allocated in units of n bytes. a. Assume that you are using linked list to keep track of free memory, and the memory is 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 filed. How many bytes of storage are required for this method? b. If you use bit map to keep track of memory, how many bytes will be required?