Consider the following references that a program makes $1,2,3,4,2,1,5,6,2,1,2,3,7,6,3$

Assuming a memory size of $4$ pages how many page fault will occur if:

A FIFO algorithm is used

A LRU algorithm is used

Now assume a memory size of $5$ pages how many page fault will occur if

A FIFO algorithm is used

A LRU algorithm is used

$2)$Consider a computer system that use paging the system has $1$ gigabyte of memory and it uses a page size of $1$ kilobyte. Assume each entry$/$row in the page map table$($PMT$)$ takes up $4$ bytes of memory

How much memory would be needed to store the page map tables in memory if all the pages are in use