This is the question and it must be in C++ form. sequence order. Then search for and return any keys in the range \( \left[\mathrm{N}, 2^{*} \mathrm{~N}\right] \). Input: \( \mathrm{N} \) Output: (a) the tree; (b) array of keys found (empty array or 1 answer