Given memory holes (i.e., unused memory blocks) of 100K, 500K, 200K, 300K and 600K (in address order) as shown below, how would each of the first-fit, next-fit, best-fit and worst-fit algorithms allocate memory requests for 285K, 115K and 355K (in this order)? The shaded areas are used/allocated regions and are not available. Write your answers next to the letters corresponding to the memory blocks in the diagram. If more than one request fits in a block, write them in the correct order. (4 marks)

100k 500k 200k 300k 600k A B D E