Implement in (c, c++ or java) a split version to conquer the algorithm that finds the largest element in a vector. This algorithm must divide the data set up to the stop case, which is when there are only 1 or 2 elements to be analyzed and the answer is trivial. The combination must define the largest element, based on the largest elements obtained from the smallest instances of the problem. After implementing this algorithm, write the recurrence equation and determine the complexity using the recursion tree method. Question: Is the complexity of this algorithm better than the iterative brute force solution (which runs through all the elements and stores the largest one)?