Problem
The mergeable heap ADT consists of operations insert(k,x), remove Min(), union With(h), and min(), where the union With(h) operation performs a union of the mergeable heap h with the present one, destroying the old versions of both. Describe a concrete implementation of the mergeable heap ADT that achieves O(logn) performance for all its operations.