Assume that Contiguous Memory Allocation scheme is followed, and in a particular case there are six empty holes of 250KB, 550KB, 300KB, 140KB, 700KB, and 100 KB scattered throughout the main memory of our system, in the given order, with none of the holes being adjacent to another hole.
a) How would the first-fit, best-fit, and worst-fit memory allocation strategies place processes of the following sizes in those holes: 95 KB, 450 KB, 458 KB, 140 KB, and 350 KB (in this given order)? Give the current state of the memory (i.e., which hole holds the assigned process, and the sizes of the remaining holes) after each process is assigned to a hole. You can assume that none of the placed processes are phased out from the memory until all of the processes are placed.
b) If you were asked to rank the performance of the three strategies according to their performance on the placement of the above given processes, how would you order them from the best performer to the least performer? Why? Explain and justify your answer