English (en) Ti Given the following algorithm for computing the factorial of positive integers. factorial n) begin if(n=2) then factorial = n else factorial = n* factorial(n-1) end The execution time (n) of this algorithm can be represented by which of the following recurrences: Select one: O a (n) - 2 T(1/2) +n Ob, T(n) = n + V(n-1) OcTn) - S, where c is positive constant Tw) - (0-1) + 1