solve with explanation and math

Suppose we have an array of n items that we want to sort. Now suppose we devise a sorting algorithm that has the property that in every step of the algorithm, no data item moves more than logn places in the array in any step of the algorithm. Show that this algorithm runs in time at least (n2/logn) in the worst case. (Note that an item in the array will sometimes need to move more than logn places in the array over the lifetime of the algorithm - for example, if the smallest element in the array starts at the last place in the array - but in any step of the algorithm, it never occupies a place more than logn places away from where it was in the previous step.)