Examine the recursive procedure below:

 Recursive-Fn(n) 1. if n == 0 or n == 1 or n == 3 2. return 1 3. else 4. return Recursive-Fn(n/3) + Recursive-Fn(n/3) + n 

Choose the correct recurrence equation that describes the worst-case runtime from the choices below. The base case is T (0) = (1) for all the choices below. *Justify your answer*.

1. T(n) = 2T(n/3) + (1)

2. T(n) = T(n/3) + T(2n/3) + (1)

3. T(n) = 2T(n/3) + (n)