In the stack implementation of the LRU algorithm, a stack can be maintained in a manner :

• A. whenever a page is used, it is removed from the stack and put on bottom
• B. the bottom of the stack is the LRU page
• C. the top of the stack contains the LRU page and all new pages are added to the top
• D. none of the mentioned