Assume we are dealing with a system that places programs in memory using dynamic partitioning. At some point in time we have just loaded a program that needed 68 Mb, and memory is as depicted below (not to scale). Shaded (blue) regions are full, blanks are holes (with sizes in Mbytes as indicated); the cross-hatched region is the location of the most recently loaded program, it is at least 68 Mb in size. Show, on the memory diagram below, where the following sequence of new programs will be positioned and the resultant holes. The programs arrive in order 34Mb, 8 Mb, 10 Mb, 6 Mb, 24 Mb of memory. Repeat this problem for First Fit, Next Fit, Best Fit, and Worst Fit

20 12 34 40 90