A process generates the following sequence of virtual addresses. Construct the corresponding reference string. 110 202 311 424 544 331 422 223 390 577 591 597 464 533 224 How many faults would be generated under the Optimal replacement algorithm? [Assume a 3- frame allocation under demand paging (i.e., one page at a time), and let page sizes be 100. Show each stage of memory reference and indications of fault or no-fault for both methods.]