Let L be a list of n items maintained according to the move-to-front heuristic. Describe a series of O ( n ) accesses that will reverse L .   Suppose we have an n -element list L maintained according...

Let
L
be a list of
n
items maintained according to the move-to-front heuristic.

Describe a series of
O(n) accesses that will reverse
L.

Suppose we have an
n-element list
L
maintained according to the moveto-

front heuristic. Describe a sequence of
n
²
accesses that is guaranteed

to take ∑(n
³) time to perform on
L.

Implement a clear( ) method for the FavoritesList class that returns the list

to empty.