Next-fit is an allocation algorithm that starts by using the first-fit algorithm, but it keeps track of the partition that was last allocated, so that it can start its next search from that exact spot instead of restarting the search with Block 1. In other words, it starts searching from the most recently allocated block when the next job arrives. 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: Job List: Memory Block List: Job Number Memory Requested Memory Block Memory Block Size Job A 625K Block 1 250K Job B 44K Block 2 900K Job C 900K Block 3 280K Job D 220K Block 4 200K Block 5 50K Job List: Memory Block List: Job Number Memory Requested Memory Block Memory Block Size Job A 44K Block 1 250K Job B 220K Block 2 900K Job C 670K Block 3 280K Job D 64K Block 4 200K Block 5 750K a. Indicate which memory blocks are allocated to each of the arriving jobs.
b. Explain in your own words what advantages the next-fit algorithm could offer.