Suppose binary heaps are represented using a pointer-based treerepresentation instead of an array. consider the problem of mergingbinary heap lhs with rhs. assume both heaps are full completetrees, containing (2^l) - 1 and (2^r) -1 nodes, respectively. give two o(log n) algorithms to merge the two heaps if l = r andif |l - r| = 1