7. (20 points)The diagram below shows a set of memory blocks, with some blocks allocated and some blocks free. Block A is at the lowest address, Assume that the last block to be allocated was block B. Four requests arrive allocate 120K, allocate 56K, free Block D and allocate 200K (in this order). Explain which blocks would be allocated to satisfy each request using the four allocation strategies discussed for dynamic memory allocation. SHOW hovi the contents of memory would be altered by each allocation!!!!!!! (NOTE that for all four of these strategies free memory blocks can be linked in order by increasing address) A: 400K (free) B: 90 K (allocated) C: 150 K (Free) D: 50K (allocated) E: 200K (free) F: 110K (allocated) G: 300K (free) Roving Pointer to last block allocated