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 config- uration 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: Job List: Job Number Job A Job B Job C Job D Memory Requested 44K 220K 670K 64K Memory Block List: Memory Block Block 1 Block 2 Block 3 Block 4 Block 5 Memory Block Size 250K 900K 280K 200K 750K .