Consider a memory management system using the first fit algorithm for memory allocation. that is, whenever a process needs to be allocated memory, the system will look for the first (lowest-addressed) 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 near the tail (higher-address end) of the free chunk for the process. let there be 192mb of space set aside, starting from address 64mb, to manage all the user processes in the system. let the following table depict the memory layout for a set of five processes in the system: process memory amount starting locationp1 16mb 72mbp2 12mb 88mbp3 8mb 124mbp4 4mb 132mbp5 20mb 166mbnow consider the following sequence of events in the system: new process p6 starts and is allocated 28mb of memory. new process p7 starts and is allocated 16mb of memory. process p2 terminates and releases its memory. new process p8 starts and is allocated 16mb of memory. process p5 terminates and releases its memory. new process p9 starts and is allocated 12mb of memory. new process p10 starts and is allocated 4mb of memory. construct the memory layout after processing the above sequence of memory management events. based on this layout, identify the true statement among the following? a) the smallest free chunk has a size of 4mb. b) the largest free chunk is between 96mb and 128mb in size. c) process p7's memory starts at 100mb. d) process p9's memory starts at 244mb.