Design an algorithm that replicates the little elf's approach to finding the only heavier box in a large pile of boxes using Divide and Conquer.

Write the worst-case running time T(n) for your designed algorithm using recurrence.

Solve the recurrence above using the recursion-tree method. Draw the resulting tree and write down the resulting O(T(n)).