1. Given the following conguration 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: Memory Block List: Job Number Memory Memory Block Memory Requested Block Size Job A 256K Block 1 910K Job B 900K Block 2 900K Job C 50K Block 3 200K Job D 350K Block 4 300K a. Use the best-t algorithm to indicate which memory blocks are allocated to each of the arriving jobs. b. Use the rst-tit 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