In the Least Recently Used (LRU) page replacement algorithm, which page is…

The Least Recently Used (LRU) page replacement algorithm selects the page that has not been accessed for the longest period of time among all pages currently in memory. This strategy is based on the principle of locality, which suggests that if a page has not been used recently, it is unlikely to be needed in the immediate future. Therefore, option C is correct because LRU specifically tracks access times and evicts the page with the oldest timestamp. Option A is incorrect because predicting future usage belongs to Optimal (OPT) replacement, not LRU. Option B is incorrect because the duration a page has been in memory does not necessarily correlate with its recent usage; a page could have been loaded long ago but accessed frequently. Option D is incorrect as priority-based replacement relies on assigned priorities rather than access history.