Given 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:
Memory Block List:
Job Number
Memory Requested
Memory Block
Memory 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-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.

Develop the program incrementally: a) start by reading and displaying each line of the input file to make sure you are reading the data set correctly. b) use the split string method to extract information from each line into a list. print the list to prove that this step is working correctly. d) convert the exam scores to type int and calculate the student’s average. display those items to prove this step is working correctly. e) create a tuple containing the six items for each student (name, exam scores, exam mean). display the tuples to prove this step is working correctly. (optionally, you may want to have the exam scores in a list so your tuple is (name, scores_list, f) append each tuple to a list. display the list to prove this step is working correctly. g) use the sort list method to re-order the tuples in the list. display the list to prove this step is working correctly. h) use a for statement to display the contents of the list as a table (with appropriate formatting). i) use a for statement to calculate the average of all scores on exam #1, then display the results. note that you could have calculated this average within the first loop, but we are explicitly requiring you to do this calculation by looping though your list of tuples. j) add the logic to calculate the average of all scores on exam #2, then display the results.