Whats the amortized cost of single access?

Consider a singly linked list data structure that stores a sequence of items in any order. Accessing the item in the i-th position requires i time units. Also, any two contiguous items can be swapped in constant time. The goal is to allow access to a sequence of n items in a minimal amount of time. The TRANSPOSE is a heuristic that improves accessing time if the same item is accessed again. TRANSPOSE works in the following way: after accessing x, if x is not at the front of the list, swap it with its next neighbor toward the front