Problem $6($b$)$ Page Replacement BONUS I will add a point or two if you get this correct and show your solutions.

Consider that the page size is $4096($decimal$)$ and the following memory reference string $($hexadecimal$)$:

$12$e$5,290$a$,367$c$,478$b$,2$bb$6,19$bc$,5671,689$c$,212$a$,189$c$,223$f$,3$fff$,7$ffe, $6$efe, $3$eee, $2126,$

$1$ace, $2$ecb. How many page faults would occur for the FIFO replacement algorithm, assuming five frames.