Show that the logarithmic amortized bound for skew heap operations is not a worst-case bound by giving a sequence of operations that lead to a merge that requires linear time. Show that both the...

Show that the logarithmic amortized bound for skew heap operations is not a worst-case bound by giving a sequence of operations that lead to a merge that requires linear time. Show that both the decreaseKey and increaseKey operations can be supported by skew heaps in logarithmic amortized time.