case studythe move-to-front heuristic using sorted list and nested class using list with the move-to-front heuristic possible uses of favorites list exercises java datastructures net array lists suppose we have collection of elements stored in certain linear orderso that we can refer to the elements in as firstsecondthirdand so on such collection is generically referred to as list or sequence we can uniquely refer to each element in using an integer in the range [ , that is equal to the number of elements of that precede in the index of an element in is the number of elements that are before in hencethe first element in has index and the last element has index alsoif an element of has index iits previous element (if it existshas index and its next element (if it existshas index this concept of index is related