2. Suppose you have a operating system that uses segmentation on a computer with 1M of physical memory. A series of programs are executed on this computer, performing the following series of allocations and deallocations allocate Block A: 512k allocate Block B: 256k allocate Block C: 64k free Block B allocate Block D: 186k allocate Block E: 190k complete all parts and show work (a) What is the biggest hole size in physical memory at the end of the above sequence if first-fit is used? (b) What is the biggest hole size in physical memory at the end of the above sequence if best-fit is used? (c) What type of fragmentation does this computer suffer from: external or internal? For parts (d) and (e), suppose that the operating system pages the segments so that each segment is comprised of 4k pages. The allocations and deallocations work as before. (d) In total, how much memory is being wasted by external fragmentation? (e) In total, how much memory is being wasted by internal fragmentation? 2. Suppose you have a operating system that uses segmentation on a computer with 1M of physical memory. A series of programs are executed on this computer, performing the following series of allocations and deallocations allocate Block A: 512k allocate Block B: 256k allocate Block C: 64k free Block B allocate Block D: 186k allocate Block E: 190k complete all parts and show work (a) What is the biggest hole size in physical memory at the end of the above sequence if first-fit is used? (b) What is the biggest hole size in physical memory at the end of the above sequence if best-fit is used? (c) What type of fragmentation does this computer suffer from: external or internal? For parts (d) and (e), suppose that the operating system pages the segments so that each segment is comprised of 4k pages. The allocations and deallocations work as before. (d) In total, how much memory is being wasted by external fragmentation? (e) In total, how much memory is being wasted by internal fragmentation