3. Answer the following by considering a page-reference string having 22 page references with seven unique page references. a. Give steps and calculate for Optimal Page Replacement algorithm number of...

3. Answer the following by considering a page-reference string having 22 page references with seven unique page references.

a. Give steps and calculate for Optimal Page Replacement algorithm number of page faults by considering 4 frames and 6 frames.

b. Give steps and calculate for Least Recently Used algorithm number of page faults by considering 4 frames and 6 frames.

c. Write the pseudocode/Algorithm for the best performing page replacement algorithm among the Optimal Page Replacement and Least Recently Used algorithm for the given scenario.

 Note: All frames are initially empty, so your first unique pages will cost one fault each.