Consider the following declaration. f :: Int -> Int f1 = 1 fn = if even n then f (n 'div 2) else f (3*n+1) Which of the following recurrences describes the run-time cost T(n) of the function f for n > 2? Select one alternative: if n is even 3n+1+ (1) otherwise T(n) = max{T([n/2]), T(3n+ 1)} + (1) I(n) = { 1/2 if n is even otherwise T(n) = T([n/2]) +T(3n+ 1) + (1) T([n/2])+9(1) T(n) if n is even T(3n+ 1) + (1) otherwise