Consider the reference string for different page replacement algorithm: b, a, e, b, b, a, c, f, d, b, e, a, c,f for how many page frames (all initially empty),

Consider the reference string for different page replacement algorithm: b, a, e, b, b, a, c, f, d, b, e, a, c,f For how many page frames (all initially empty), all of LRU, FIFO and optimal page replacement algorithms will result in equal number of page faults? a) 2 4 c) d) None of these 6