Consider the following page-reference sequence used by a program. 1,2, 2, 3, 4, 1,3, 1,2,1 The program has 3 page frames available to i, and initially there awre no pages laded in the memory. If the system uses a leas reemily used Q.RU) pae replacement strategy, how many page faults would there be or the page-reference sequence above? O B) 4 OD) O E) 10