$(3$ pts$)$ Assume you have a page reference string for a process with $F$ frames $($initially all empty$).$ The page reference string has length $L$ with $D$ distinct page numbers occurring in it$.$ For any page$-$replacement algorithm, assuming pure demand paging, what is the Maximum number of Page Faults possible?

a$)F$

b$)L$

c$)D$