A job has four pages A$,$ B$,$ C$,$ D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that the page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts optimal page replacement algorithms are