+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Suppose that we have made kn total accesses to the elements in a list L of n elements, for…

1. Suppose that we have made kn total accesses to the elements in a list L of n elements, for…

1. 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?2. 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.