Problem Using a dynamic partitioning scheme and considering the following memory configuration snapshot at a given point in time in Megabytes (M): 20 20M The shaded red areas are allocated blocks and green areas are free blocks. Three processes PI, P2, and P3 make the requests for 40M, 20M, and 10M memory, respectively. Show how each of the following placement algorithms allocates the requests by filling out the provided table: a) First-fit 20 20M b) Best-fit 20 20 ) Worse-fit 20 20 20