Kindly answer it. I need it urgently.

Compensatory Assignment Question 1 A process references five pages A, B, C, D and E, in the following order: E, D, C, B, A, B, C, A, B, E, C, D Assume that the replacement algorithm is FIFO and find the number of page faults during this sequence of references starting with an empty main memory with three page frames. Repeat for four page frames