Given the following information about Physical memory, Logical memory and Page size of a system. Physical address space: 64 Logical address space: 8 Page size: 2 f d Physical address format: ml-n n d Logical address format: m2-n n Q1: Fill the information of the empty green cells. n m1 m2 -digits number digits number -digits number Q2: Fill the binary adresses of the empty green cells. Logical Hemory Page Table age indefrane lade Physical Memory P 2 20 Given the reference string of a process page demands Q3: Complete the frames content during the different page demands of the process according the different frame sizes and using the following algorithms: FIFO, LRU and Optimal. Determine the number of page faults for each algorithm. (Fill green cells) Reference String 3 1 3 3 1 5 3 6 1 0 3 4 5 6 3 2 1 1 2 1 3 4 1 7 0 1 0 5 4. 7 1 4 4 4 1 6 0 1 4 5 FIFO Algorithm Frame size: 3 #Pgae faults: Reference String 3 1 1 3 3 1 5 w 3 o 5 4 6 7 1 1 4 4 0 3 4 5 6 4 1 3 2 1 1 2 6 0 - 1 3 3 4 1 1 1 7 4 0 5 FIFO Algorithm 5 Frame size: #Pgae faults: Reference String 3 1 1 3 3 1 5 3 4 5 6413 2 1 1 2 60 1 3 4 1 1 7 40 5 LRU Algorithm Page 3 Frame size: #Pgae faults: Reference String 3 1 1 3 3 1 5 3 0 5 4 6 7 1 1 4 4 0 3 4 5 6 4 1 3 2 1 1 2 6 0 1 3 4 1 1 7 4 0 1 LRU Algorithm Frame size: 5 #Pgae faults: Reference String 3 1 1 3 3 1 5 3 0 5 4 6 7 1 1 4 4. 0 3 4 5 6 4 1 3 2 1 1 2 6 0 1 3 4 1 1 7 4 0 1 Optimal Algorithm 3 Frame size: #Pgae faults: Reference String 3 1 1 3 a 3 1 5. 3 0 5 4. 6 7 1 1 4 4 0 3 5. 4 6 4 1 3 2 1 1 2 6 0 1 3. 4 1 1 7 4 0 1 Optimal Algorithm 5 Frame size: #Pgae faults