If there were 10 programs where each program is double the size of the previous program and takes twice as long to run. The first program is 2K, and takes 2 seconds to run, the second is 4K and 4 second to run, the third is 8K and 8 seconds to run. However, for the OS to load each program into memory take from 1 to 10 seconds from the smallest to the largest program. So, the 2K program takes 1 second, the 4K, 2 seconds, the 8K, 3 seconds and so on.

The system has 1536K of memory.

If the Operating system is a dynamic partition system. Show how first-fit, and, best-fit would work when working with the 10 programs P1-2K....P10=1024K.