Q$1)$ Consider the following page reference string: $7,0,1,2,0,3,0,4,2,3,0,3,1,2,0$

How many page faults would occur for the First in First out $($FIFO$),$ assuming three frames?

FIFO Rule: Oldest page in the memory will be replaced. It has lowest page fault rate..

$(2\mathrm{.}5$ Marks$)$

Q$2)$ Consider the following page reference string: $7,0,1,2,0,3,0,4,2,3,0,3,2,1,2$

How many page faults would occur for the least recently used $($LRU$/$LFU$),$ assuming three frames?

LRU Rule: replaces the least recently used page with new page.

$(2\mathrm{.}5$ Marks$)$

I want the solutions to be in tables, without explanation.