Suppose we have the diagram of memory shown below under a dynamic partitioning scheme. Blue areas represent blocks occupied by processes, blanks are holes (with sizes in Mbytes as indicate), The cross-hatched region is the location of the most recently loaded process. It is the only process in that region of memory. Its size is 5 M-byte. Only one process was swapped out after that. What is the maximum size of the swapped-out process? What is the size of the free block just before it was portioned by the crosshatched process? What algorithm was used to place the 5 Mbyte process?Why?

20 12 34 90