Problem
Disprove that "The height of n node Fibonacci heap is always O(log n)."
Show that for any positive number of nodes n, a sequence of Fibonacci heap operations that create a Fibonacci heap that consists of one tree that is a linear chain of ?? nodes. What is that sequence of operations? Draw an example heap with the sequence of operations for demostrating argument.
And pseudo code for the process that will form a linear chain of n nodes.