You need to first provide the recursive algorithm (parts of it given below; complete it), using pseudocode conventions, and then develop and state the two recurrence relations. you do not have to provide the constant values; instead use θ(1) for a constant value, θ(n) for a constant multiplier of n, etc. you do not need to solve the recurrences.