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

The x axis gives the time and the y axis gives the value of the investment.

x = 1, x = 2, x = 3 means the value of the investment after 1 year, 2 years, 3 years, respectively.

The point (1, 142.50) tells us the value [ y value = 142.50 ] of the investment after 1 year [ x = 1 ].

Out of the answer choices, the first one is correct.

ANSWER: "The value after 1 year"