Please be quick , ı need this question's answer
Consider the following page reference string:
7, 7, 2, 2, 7, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1
Assuming demand paging with three frames, how many page faults would occur for the LRU page replacement
algorithm?