For the following page-reference string:

7, 0, 1, 2, 1, 3, 1, 4, 2, 3, 0, 3, 7, 1, 2

How many page faults would occur for the Optimal algorithms replacement, assuming 3 frame, all frames are initially empty, so first unique pages will all cost one fault each.

701213142303712