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 an upper bound on the number of page faults?

yes we can change both the color of the value of a cell as well as background color of a cell at the same time .

as we know that excel sheet consists of columns and rows.

and intersection of column and row is called cell.

we can change color of the cell and background of the cell at the same time.

hence the statement that

can a person change color of the cell and background of the cell at the same time is true.

answer; i believe the correct answer is 50 pounds;