Consider a page reference string for a process with a working set of m frames, initially all empty. the page reference string is of length p with n distinct page numbers in it.
for any page replacement algorithm, what is a lower bound on the number of page faults?

hi,

a perfect network would be right as you search something it would work in a snap, super protected, no hackers, would have maintenance every week, everyone one would share anything and everything as long as its safe, no viruses or over 18 stuff.communication would be like hangouts, and a network administrators would check what is happening and check if everything is safe.

hope this !

you are welcome for my answer it is b⇔⇒⊕