DYNAMIC STORAGE-ALLOCATION PROBLEM How to satisfy a request of size n from a list of free holes o First-fit:Allocate the first hole that is big enough o Best-fit:Allocate the smallest hole that is big enough; must search entire list,unless ordered by size Produces the smallest leftover hole o Worst-fit:Allocate the largest hole;must also search entire list Produces the largest leftover hole First-fit and best-fit better than worst-fit in terms of speed and storage utilizationDYNAMIC STORAGE-ALLOCATION PROBLEM  First-fit: Allocate the first hole that is big enough  Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size  Produces the smallest leftover hole  Worst-fit: Allocate the largest hole; must also search entire list  Produces the largest leftover hole How to satisfy a request of size n from a list of free holes First-fit and best-fit better than worst-fit in terms of speed and storage utilization