Q2. A dynamic partitioning scheme is being used and the following is the screen shot of memory configuration at a given point in time BKB 14KB 19KB 11KB 13KB Primary Memory The shaded areas are allocated blocks, while the white areas are free blocks, suppose a process requests 12KB of memory and the memory manager currently has a list of unallocated blocks of 6KB, 14KB, 19KB, 11KB. and 13KB blocks. Indicate the starting address for each of the three blocks using the following placement algorithms: a) First fit b) Best fit c) Next fit. Assume the most recently added block is at the beginning of the memory d) Worst fit