To implement LRU, each page uses a referenced bit. If we wanted to implement a least frequently used (LFU) page removal algorithm, where the least-used page would be removed from memorv. what would we need to add to the tables? What software modifications would have to be made in order to support this new algorithm?

Discuss situations under which the least frequently used page- replacement algorithm generates fewer page faults than the least recently used page replacement algorithm. Also discuss under what circumstance does the opposite holds.

Each group represents one OOP principle.Create a new thread and for each grouping, identify the OOP principle that is best represented by the images i the group. Explain what made you think the grouping represents the OOP principle you chose. Use acronym APIE to recall what the principles are - Abstraction, Polymorphism, Inheritance, Encapsulation. Grouping 1 caring1 caring 2 caring3 caring5 Grouping 2 brown Blue House Key family Grouping 3 package1 package2 package3 package4 Grouping 4 painting thoughts car leaf