Min-Max Queries

For an array $B$ of length $M$, define a recursive function $\mathrm{min\_max}(B)$ as follows: - If $M = 1$, then $\mathrm{min\_max}(B) = B_1$. - If $M$ is even, then $\mathrm{min\_max}(B) = \mathrm{min\_max}(\mathrm{adjacent\_maxima}(B))$. - If $M$ is odd, then $\mathrm{min\_max}(B) = \mathrm{min\_max}(\mathrm{adjacent\_minima}(B))$. Here: - $\mathrm{adjacent\_maxima}(B)$ is the array $D$ of len