- Consider a computer system that uses dynamic partitions and swapping to manage memory, suppose it has 10,000 bytes of main memory, currently allocated as shown by the following table and the last process placement in the memory is process B (The amounts and addresses are in decimal,)

Locations	Contents
0 -1999	Operating system
2000 -2999	Free
3000 - 3999	Process A
4000 - 4499	Free
4500 - 7499	Process B
7500 - 9999	Free

Suppose we now need to allocate space first for process C, which needs 400 bytes, and then for process D, which needs 200 bytes. At what addresses (locations) will memory be allocated for these two processes if we use

1- Best-fit strategy for allocating memory

2- Next-fit strategy for allocating memory

3- First-fit strategy for allocating memory