$8\mathrm{.}5.$ A process references five pages, A$,$ B$,$ C$,$ D$,$ and E$,$ in the following order:

A; B; C; D;A;B; E; A; B; C; D; E

Assume the replacement algorithm is first$-$in$-$first$-$out and find the number of page

transfers during this sequence of references starting with an empty main memory with

three page frames. Repeat for four page frames.