Return both the smallest and the largest elements ({min, max}) in a non-empty array of integers. We'll use the convention of considering only part of the array that begins at a given index and ends at another. In this way, a recursive call can work through any part of the array. The initial call will pass in index 0 and the index to the last element. The return value should be a two-element array containing the smallest first and the largest second.