Please write a full answer and give a good explaination. Do not answer it if you do not know it!

In a dynamic memory management system that is responsible for contiguous-memory allocation, differently sized "holes" of free memory are available in the following order (from left to right): 15 KB. 10 KB. 26 KB. 30 , 21 KB. 13 KB, and 17 KB. Now, contiguous- memory mi of size m1-16 KB, m2-8 KB, m3-20 KB, m4-15 KB and m5-5 KB is requested in consecutive order. 1. Draw a table or chart (like the example on slide 8-25) to represent these memory holes and to show into which of these holes each of the strategies First Fit, Next Fit, Best Fit, and Worst Fit would allocate these requests. 2. How many search steps does each of the four allocation strategies need for placing all the requests? Assume that a very basic data structure is used: a list of free memory "holes" which uses always the above initial ordering (i.e. no optimisation made to reduce the number of steps to search for the biggest or best hole). If a hole shrinks, this entry remains at its list location, just the size gets updated Hint: checking whether mi fits into the first hole is one search step, checking then the next hole is another step, also the step that leads finally to a fit counts as a search step