1. Considering the following paging table, pages and frames, Compute the physical addresses for the following logical addresses. Page Paging Table Frames 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0100 0 1 0 1 0 1 1 0 Page Frame Valid/INVALID 0 0 1 1 0 1 0 0 0 1 0 1 No NO 0 1 1 0 000 VALID 0 1 1 1 1 0 0 0 001 110 VALID 010 101 VALID 011 100 VALID 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 1 1 000 1001 1 0 1 0 1 0 1 1 1100 1 1 0 1 1 1 1 0 100 101 VALID 111 INVALID 110 001 valid 1 1 1 1 1 1 1 1 Page No Offset Frame No Physical address Logical Address 0001 0010 1110 1100 2. Considering the following segment table, Segment Base Length 0 1400 100 1 3000 50 2 900 500 3 200 700 4 80 10 What are the physical addresses for the following logical addresses under the segmentation technique? Physical Address Logical Address 2,70 1 2 4,100 3 3,500 4 2,600 Hole Choosing Algorithm 3. Assume that requests come in the following order:P1 needs BK, P2 needs 20K , P3 needs 28K Allocate the holes according to the following algorithms: Best FIT, First Fit, and Worst Fit algorithms Best FIT 34 K 6K 18 K 40K 14K 22K 32K First FIT 34 K 6K 18 K 40K 14K 22K 32K Worst FIT 34 K 6K 18 K 40K 14K 22K 32K