Question $3.$ Page Replacement $(30$ prs$)$

Consider pure demand paging as fetch policy. A process contains seven virtual pages $,3,4,5,6$ on disk and is assigned to a fixed allocation of three page frames $(0,1,2)$ in main memory which are initially empty. Consider the following reference string:

$3,2,1,4,2,1,5,6,1,2,3,0,3,5,3,6,4$

Show the successive page residing in the three frames using the FIFO, LRU and Optimal policies starting with an empty main memory. How many page faults would occur in each case?

FIFO Policy

$\backslash$table$[[\backslash$table$[[$Number of$],[$page faults$]]]]$

LRU Policy

Optimal Policy

$\backslash$table$[[$Ref$.$ string $,3,2,1,4,2,1,5,6,1,2,3,0,3,5,3,6],[$Frame $0,,,,,,,,,,,,,,,,],[$Frame $1,,,,,,,,,,,,,,,,],[$Frame $2,,,,,,,,,,,,,,,,]]$

Page Fault $$

Number of

please i want correct and full answer with explanation with details