$[6$ pts$.]$ Demand Paging: Consider the reference string $R$ and an allocation of $3$

frames for a given process. For each of the following, show the memory representation

and calculate the total number of page faults.

Indicate an asterisk $(\{$:${?}^{*})$ for each page fault.

$R=\{5,4,3,1,4,5,6,7,4,5,4,3,5,7,3,4,5,4,3,7\}$

A$)$ Show the memory representation using the LRU algorithm.

Total number of page faults:

B$)$ Show the memory representation using the OPT $($Optimal$)$ algorithm.

Total number of page faults: