Imagine a cache system within a database server that employs the

LRU cache replacement policy. This cache has a capacity for four

pages. The page request sequence is as follows: $[4,2,5,4,3,2,4,5,8,7].$

Simulate this sequence of page requests using the LRU replacement

policy and calculate the total number of page faults. Start with

an empty cache. For each page request, indicate whether it hits

or misses the cache. For cache misses, show which page is replaced,

following the LRU policy. Track the order of pages to accurately de

termine the least recently used page. Present the final configuration

of the cache after all requests have been processed.