Enter a sequence of numbers 1, 2,. , , , n, so that the search tree built with these numbers (in the given order) reaches best-case depth. It may be assumed that n = 2k -1 for a constant k ? 1. In addition, specify an algorithm in pseudo-code that generates such a sequence of numbers.