Consider the trace of page references: 0, 4, 3, 2, 0, 2,2, 3, 0, 4, 7,0, 9,3, 0, 2, 3. Show the frame allocation for the following algorithms if four frames are allocated to the demanding process. Determine the rates of page success and page fault for each algorithm. Use the table provided below to show your work. AGING (counter on 4 bits and updated after each three references) Ref
OR
OR