An access sequence of cache block addresses is of length N and contains n unique block addresses.The number of unique addresses between 2 consecutive access to the same block address is bounded above by k. What is the miss ratio if the access sequence is passed through a cache of associativity A>=k exercising least recently used replacement policy
a) n/N
b)1/N
c)1/A
d)k/n
Please if possible do explain with a small example
(i.e) assuming values for all these variables
