A process has a memory reference pattern as follows: 4 3 1 2 3 4 1 4 1 2 3 4 The above pattern (which represents the virtual page numbers of the process) repeats throughout the execution of the process. Assume that there are 3 physical frames. What would be the paging activity for an optimal page replacement policy for the first 12 accesses? Indicate which accesses are hits and which are page faults.