Given the set of element { a , b , c , d , e , f } stored in a list, show the final state of the list, assuming we use the move-to-front heuristic and access the elements according to the following...

Given the set of element {a,b,c,d,e,
f
} stored in a list, show the final state

of the list, assuming we use the move-to-front heuristic and access the elements

according to the following sequence: (a,b,c,d,e,
f
,a,c,
f
,b,d,e).

Suppose that we have made
kn
total accesses to the elements in a list
L
of

n
elements, for some integer
k
≥ 1. What are the minimum and maximum

number of elements that have been accessed fewer than
k
times?