(TCO 5) Consider a memory management system using the Best Fit algorithm for memory allocation. That is, whenever a process needs to be allocated memory, the system will look for the smallest free chunk of memory that is at least as large as the amount of memory needed by the process. When a free chunk is found, assume that the system allocates memory from the beginning (lower-address end) of the free chunk for the process. Let there be 400MB of space set aside, starting from address 112MB, to manage all the user processes in the system. Let the following table depict the memory layout for a set of seven processes in the system: Process Memory Amount Starting Location P1 40MB 172MB P2 12MB 224MB P3 32MB 236MB P4 48MB 312MB P5 8MB 382MB P6 90MB 390MB P7 8MB 504MB Now consider the following sequence of events in the system: Process P5 terminates and releases its memory. New process P8 starts and is allocated 32MB of memory. New process P9 starts and is allocated 24MB of memory. Process P6 terminates and releases its memory. Process P2 terminates and releases its memory. New process P10 starts and is allocated 20MB of memory. Construct the memory layout after processing the above sequence of memory management events. Based on this layout, identify the FALSE statement among the following.

A. Process P8's memory starts after process P10's memory.

B.	There is a free chunk of 4MB starting at location 232MB.

C.	Process P9's memory starts at location 360MB.

D.	Process P9's memory starts after process P10's memory.