A process refers to 5 pages, A, B, C, D, E in the order: A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is 7. If the number of page frames is increased to 4, then the number of page transfers :
1
decreases
2
increases
3
remains the same
4
None of these