Problem
1. Suppose we have an n-element list L maintained according to the move-to-front heuristic. Describe a sequence of n2 accesses that is guaranteed to take ?(n 3 ) time to perform on L
2. Design a circular node list ADT that abstracts a circularly linked list in the -same way that the node list ADT abstracts a doubly linked list.