Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page replacement
algorithms, What is lower and upper bound on the number of page faults?
(A) m, n
(B) p, m
(C) n, p