A Fibonacci heap containing n nodes can have a single tree with height n, consisting of a root connected to a leaf by a path of n nodes. This contrasts with a binary heap, where the maximum height of a tree storing n elements is logn. A sequence of O(n) Fibonacci heap operations starting from an empty heap can construct such a tree with height n and a single path from the root to a leaf.

1. (b) (5 pts) In this part you will show that a tree in a Fibonacci heap on n nodes could have height
much larger than logn, in contrast to the simple binary heap whose height when storing n elements
is logn. Present a sequence of O(n) Fibonacci heap operations, starting with an empty heap, that
results in a Fibonacci heap that contains exactly one tree, which is a single root to leaf path on n
nodes.