java

Suppose we are keeping track of access counts in a list L of n elements .Suppose further that we have made kn total accesses to the elements in L, for some integer k >= 1. What are the minimum and maximum numbers of elements that have been accessed fewer than k times?