Consider a page reference string for a process with a working set of four frames, initially all empty. The page reference string is of length 20 with six distinct page numbers in it. For any page replacement algorithm,
a. What is the lower bound on the number of page faults? Justify your answer.
b. What is the upper bound on the number of page faults? Justify your answer.
