Problem 3 (20 points). Use amortized analysis to give a bound on the worst-case running time of a sequence of n operations on the following data structure X: INSERT on X with n elements takes time log n and increases X's potential by logn. decreases X's potential by k-3. REMOVE on X with n elements takes time log n and increases . FIND on X with n elements takes time klog2 n where k is the number of elements examined. It the potential by 3 The data structure is initially empty. The potential of X is always 2 0 and is 0 if X is empty