The correct answer is C. worst fit.
In worst-fit, the program is placed in the largest available hole in the main memory. This is because the largest hole is the most likely to have enough space for the program, and it will leave the smallest amount of unused space in the main memory.
Best-fit places the program in the smallest available hole. This is because it is the fastest way to find a hole that is large enough for the program. However, it can leave a lot of unused space in the main memory.
First-fit places the program in the first available hole that is large enough. This is a compromise between best-fit and worst-fit. It is not as fast as best-fit, but it does not leave as much unused space as worst-fit.
Buddy system is a memory allocation algorithm that divides the available memory into a number of equal-sized blocks. When a program needs to be allocated memory, it is given the smallest block that is large enough. This algorithm is very efficient, but it can be difficult to implement.
None of the above is not a valid storage placement strategy.