Consider the reference string is 4,3,2,1,4,2,3,2,1,3,2,4,5,2,0,1,3,2,0,3,4,5,1,2,3,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)