Given a sequence of n values x₁, x₂, ... , x_n, you will need to answer queries of the form, given i, j (with i <= j), what is the smallest value in the subsequence x_i, ... , x_j? Show how to answer queries in O(log n) time per query using O(n log n) space.