Suppose a system uses the First Fit, Best Fit, and Worst Fit memory allocation strategies. Initially, there is $1GB$ of total memory with the following free memory partitions:

First Fit: $200MB,400MB,100MB,300MB$

Best Fit: $150MB,250MB,200MB,350MB$

Worst Fit: $100MB,450MB,150MB,300MB$

If three processes of sizes $180MB,250MB,$ and $400MB$ arrive in order, which allocation strategy$($s$)$ will result in the LEAST amount of fragmentation?

First Fit and Best Fit

Best Fit only

Best Fit and Worst Fit

Worst Fit only