5. Given 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: Job Number Memory Block List: Memory Block Memory Block Size Memory Requested Block 1 910K Job A 256K Block 2 900K 9ook Job B 200K Block 3 5OK Job C Block 4 300K Job D 350k Exercises a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the arriving jobs. b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the arriving jobs. c. Calculate the total amount of internal fragmentation in all four blocks using the best-fit algorithm. 6. 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 9ook Job C 9OOK 280K Block 3 Block 4 Job D 220K 200K Block 5 SOK 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