5 Consider the reference string is 5,4,3,2,1,2,3,4,5,4,3,2,1,5,4,3,2,1,5,4,3,2,1,5,4,3,2,1, and 3 pages can be in memory at a time per process. What are the numbers of page faults when the Page-replacement algorithms are First-In-First-Out Algorithm, Optimal Algorithm, Least Recently Used Algorithm and Second-Chance Page-Replacement Algorithm? (40 points) 6 How can a logical address translated to a physical address translation in IA-32. (10 points) 7 At a demand paging system with TLB, suppose that the Memory access time =200 nanoseconds, Average page fault overhead + swap page out + swap page in + restart overhead =8 milliseconds TLB Lookup time is 20 nanoseconds, and TLB Hit ratio is 95%. If one access out of 1000 causes a page fault, how about the Effective Access Time? If one access out of 1000000 causes a page fault, how about the Effective Access Time? (10 points)