Which of the following is a characteristic of random page replacement algorithm?

A. It replaces the page that has been present in the main memory for the longest

B. It uses a queue data structure for implementation

C. It eliminates the overhead cost of tracking page reference

D. It cannot be implemented

Answer: Option C