Derive a recurrence describing the running time of this algorithm

1. Consider the following algorithm (don't worry about what it does we're only interested in the running time). v1 = Something (A) // A is a problem of size n (A1, A2, A3) split(A) // linear time - each Ai result has size n/2 Something(11) V2 = Something (A2) v3 - Something (A3) return max(v1, v2, v3) a. Derive a recurrence describing the running time of this algorithm. It doesn't have to be a detailed analysis, but it does need some explanation (don't just write formulas - explain where they come from)