Linux uses a least recently used $($LRU$)$ algorithm to manage memory, which was discussed in Chapter $3.$ Suppose there is another page replacement algo$-$rithm, called not frequently used $($NFU$),$ that gives each page its own counter that is incremented with each clock cycle, In this way, each counter tracks the frequency of page use, and the page with the lowest counter is swapped out when paging is necessary. In your opinion, how do these two algorithms, I.RU and NFJ$,$ compare? Explain which one would work best under normal use. and define how you perceive "nonnal use.