Suppose we are maintaining a data structure under a series of n operations Let f (k)

Question

Suppose we are maintaining a data structure under a series of n operations. Let f (k)

denote the actual running time of the kth operation. For each of the following functions f , determine the resuing amortized cost of a single operation :

f(k)=k ifk is a Fibonacci number,and f(k)=1otherwise.

Engineering Technology