3. 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, D) and with blocks shown in order from low order memory to high order memory: Job List: Job Number Memory Requested Memory Block Memory Block Size ob A ob B ob C ob D Memory Block List: 625K 44K 900K 220K Block 1 Block 2 Block 3 Block 4 Block 5 250K 900K 280K 200K 50K a) (10 points) Indicate which memory blocks are allocated to each of the arriving jobs b) (10 points) Explain in your own words what advantages the next-fit algorithm could offer