A job requests that its pages be processed in the following order:

A D B A C C B D A B C D A B B C A

There are only three available page frames.

There are only three available page frames. Using the FIFO $($first in first out$),$ LRU $($Least recently used$)$ and the MRU $($Most recently used $-$ opposite of LRU$)$ policies, trace the execution of the process in each case, evaluating which policy has the lowest number of page interrupts.