LRU vs FIFO page replacement

I am wondering if there is an instance where FIFO results in less page faults than LRU. For example:

2,6,5,7...


In this string, if I have to complete it by giving 3 additional terms, can I prove FIFO shows less page faults

I have proved how LRU can show less Page faults. But I cannot think of the initial problem statement solution. Any hints would really be great!

• Why do you put the constraint "by giving 3 additional terms"? Is this the original question? – xskxzr Feb 21 '19 at 12:12