(1 point) We have a problem that can be solved by a direct (nonrecursive) algorithm that operates in e (n2) time. We also have a recursive algorithm for this problem that takes m log n operations to divide the input into two equal pieces and log n operations to combine the two solutions together. Show whether the direct or the recursive version is more efficient