Given the following page access sequence consisting of $4$ pages $($A$-$D$),$ assuming your memory has only $2$ frames. Answer the following assuming the used replacement policy is LRU:

ABACADC

Which page will be evicted due to the access to page $"$C$"($highlighted in red$)?$ Write the letter of the page $($in uppercase$).$ If none of the pages will be evicted, your answer should be $"$X$".$

Answer: Question $3$

Question $4$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

What will be the total number of page faults in the system after completing all the accesses in the provided sequence?

Answer:Question $4$