Suppose you are investing. You want to buy low and sell high to maximize your profit. Thanks to the magic of time travel you have acquired an array of future prices, but can only perform two trades, one buy and one sell. Your array of prices is in chronological order and your buy order must precede your sell order. Design a O(nlogn) divide and conquer algorithm for finding the maximum profit you can make. Find the space and time complexity of your algorithm.