Given an O$/$S which has divided all of main memory into $4$ frames; if this O$/$S uses the FIFO algorithm for page replacement$/$swapping$,$ then how many page faults are generated if the following sequence of pages being accessed by the running process:

$102217670120304515245676724273323$