Imagine a sorting algorithm called MagicSort that uses a divide and conquer approach like Mergesort (dividing the array into halves), but instead of merging, which takes O(N) time, it performs some kind of magical operation that only takes O(logN) time. Give a recurrence relation for this algorithm and write a summation that solves the recurrence relation. You do not have to solve the summation. Hint: You can't use the Master Theorem here, so I suggest a tree. You can use a base case of T(2) = 1