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, C is the block created after the last allocation. Four requests arrive allocate 128K, allocate 256K, free Block B and allocate 64K (in this order). Explain which blocks would be allocated to satisfy each request using the four allocation strategies discussed for dynamic memory allocation. Show how 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) If an allocation can not be performed explain why.