Worst-fit is an allocation algorithm that allocates the largest free block to a new job. It is the opposite of the best-fit algorithm. Using the following configuration with jobs arriving in order (Job A, B, C, and D) and with blocks shown in order from low-order memory to high-order memory:
a. Indicate which memory blocks are allocated to each of the arriving jobs
. b. In this chapter, we introduced external and internal fragmentation
Explain in your own words, which one would be expected in a worst-fit memory allocation scheme.
