how would one solve this multiple choice question about page replacement?

$1$ Page replacement

Consider a system with $3$ physical page frames of memory. An application running on this system

$($alone$)$ has the following page reference sequence $($reference string $-$ the order of page accesses$)$:

$($accessed first$)73576274676271232($accessed last$)$

What is the number of page faults that would occur for each of the following page

replacement algorithms: