consider the following figure which conveys the operation of the Not Frequently Used $($NFU$)$ Page

replacement Algorithm with Aging as discussed in class lectures and class text. This figure shows the

current $$usage$$ of six page frames $($numbered $0$ through $5)$ currently allocated in memory for a number

of clock intervals $($every $10$ms$),$ covering a total of $5$ clock intervals. Each interval shows a snapshot of

the page usage AFTER the interval completes.

Please answer the following questions:

a$.$ After time interval T$1$ completes $($but before T$2$ starts$),$ which page $(0$ through $5)$ would be

evicted by the algorithm to make room for a new page?

b$.$ After time interval T$2$ completes $($but before T$3$ starts$),$ which page $(0$ through $5)$ would be

evicted by the algorithm to make room for a new page?

c$.$ After time interval T$3$ completes $($but before T$4$ starts$),$ which page $(0$ through $5)$ has been

used the most $$frequent$?($Justify your answer, and be VERY specific about what lead you to

this conclusion$)$

d$.$ After time interval T$4$ completes $($but before T$5$ starts, not shown$),$ which page $(0$ through $5)$

has been used the most $$frequent$?$

e$.$ Still at interval T$4,$ after completes $($but before T$5$ starts, not shown$),$ under the assumption that

ONLY page frames $0$ or $1$ are the ONLY choices for eviction, which page would the algorithm

pick? $($Justify your answer, and be VERY specific about what lead you to this conclusion$).$