Draw the positions of external and internal fragmentations.Assume a main memory is composed of two-page frames for public use and that a

program requests pages in the following order: A, B, D, D, D, B, A, A, B, C, C, B. Using the First-In-First-Out (FIFO) page removal algorithm, perform a page trace analysis indicating page faults with asterisks (*).

(best fit allocation)

Job No. Status Memory Requested Job 1 15K Allocated at Block 4 Job 2 50K Allocated at Block 3 Job 3 350K wait Job 4 200K Allocated at Block 1 Job 5 110R Allocated at Block 5 Memory Block No. Memory Block Size Job No. Job Size Status Total Waste Block 1 300K Job 4 200K Busy 100 Block 2 250K Free Block 3 50K Job 2 50K Busy Block 4 20K Job 15K Busy 5 Block 5 115K Job 5 110K Busy 5 Job No. Status Memory Requested Job 1 15K Allocated at Block 4 Job 2 50K Allocated at Block 3 Job 3 350K wait Job 4 200K Allocated at Block 1 Job 5 110R Allocated at Block 5 Memory Block No. Memory Block Size Job No. Job Size Status Total Waste Block 1 300K Job 4 200K Busy 100 Block 2 250K Free Block 3 50K Job 2 50K Busy Block 4 20K Job 15K Busy 5 Block 5 115K Job 5 110K Busy 5