Consider a $\textsf{RISC}$ machine where page tables of the virtual memory system may be swapped to disk from memory and neither machine instructions nor page-table entries nor data words can cross a page boundary. Now recall the load word $\textsf{(LW)}$ instruction of a $\textsf{RISC}$ computer: $\textsf{LW Reg-A, Reg-B, Imme}.$ The instruction loads value from memory into $\textsf{Reg-A}$ where memory address is formed by adding $\textsf{Imme}$ with contents of $\textsf{Reg-B},$ i.e.,
$\textsf{Reg-A← Mem[Reg-B + Imme]}.$
Calculate how many page faults, in the worst case, could be generated as a result of the $\textsf{fetch, decode,}$ and $\textsf{execution}$ of an $\textsf{LW}$ instruction in the above $\textsf{RISC}$ machine? Explain your answer (no marks will be awarded if justification is not given).
