Problem D. Given six non-contiguous memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB, and 80 MB (in order)? For each algorithm, DRAW a memory map consisting of 6 non-contiguous (isolated) partitions and MARK the size of each partition on the side ALLOCATE memory for the request-if satisfied-of each process in order by drawing a line and filling the size of the allocated space inside (Hint: assuming the allocated space always starts with the top in the unused space of a partition.) INDICATE which-if any-requests cannot be satisfied. Hint: When a portion of a memory partition is allocated to a process, the leftover space in this partition may still be used for the following request(s) as long as it's large enough.)