Explanation : Fro i=1: term = term * x / i = 1 * x / 1 = x. sum = sum + term = x. For i = 2: term = x * x / 2 = x2 / 2. sum = x + x2 / 2. For i = 3: term = x2 / 2 * x / 3 = x3 / 3! . sum = x + x2 / 2 + x3 / 3!. and so on... So, option (B) is correct.
Explanation : In general, in a recursive and non-recursive implementation of a problem (program) both time and space complexities are better in non-recursive than in recursive program. In some program recursive implementation gives worst case scenario too. So, recursive implementation does not guarantee for best case all the time. So, optipon (B) is correct.