Consider the following page access (e.g., page 5 is requested for access at first): 5 3 7 5 3 1 0 7 16 4 3 2 13 Determine the number of TLB hits and misses for each of the following TLB status A. TLB can hold only two entries (i.e., when loading a new one, the LRU is applied) # Hits: # Misses: B.TLB can hold only four entries (i.e., when loading a new one, the LRU is applied) # Hits: # Misses: You may use the following one to trace and count the number Working Cache Cache 1: Cache 2: Cache 3: Cache 4: Now, consider a 3-element cache with the cache arrival sequences below. Determine the number of cache hits and cache misses using each of the following cache replacement policies: Policies Optimal policy FIFO policy LRU policy #Hits #Misses