Consider the following page reference string: 0, 1, 2, 4, 0, 1, 2, 3, 2, 1

how many page faults would occur using the following page replacement algorithms:

First in First Out (FIFO) Algorithm. Assuming demand paging with three frames.

First in First Out (FIFO) Algorithm. Assuming demand paging with four frames.

The Optimal Algorithm. Assuming demand paging with three frames.

Show the content of the frames after all references are processed.