If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F (10K) [in the mentioned sequence] were received, assuming the memory locations start from the first used chunk side before the 5K slot, for 'Best Fit, process F will Hole Hole Hole Hole Hole Hole Used Used Used Used Used Used 5K 50K 30K 7K 15K 2K occupy a part of the 30K hole occupy a part of the 15K hole be denied allocation occupy a part of the 50K hole If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F (10K) [in the mentioned sequence] were received, assuming the memory locations start from the first used chunk side before the 5K slot, what is the biggest slot that remains after the Best fit allocation of these processes? Hole Hole Hole Hole Hole Hole Used Used Used Used Used Used 5K 50K 30K 7K 15K 2K 15K 12K 10K 30K 20K 50K 25K If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F(10K) [in the mentioned sequence) were received, assuming the memory locations start from the first used chunk side before the 5K slot, what is the smallest slot that remains after the Best fit allocation of these processes? Hole Hole Hole Hole Hole Hole Used Used Used Used Used Used 5K 50K 30K 7K 15K 2K 5K 1K 6K 7K 2K