Thus, in the worst case ⟶ the time complexity = O()⦁Space complexity: Space for parameters of each call is independent of i, e, n constants. So Set this constant as k.When we implement the 2nd recursive function, 1st recursive function is over. Thus we can reuse the space of 1st call for 2nd call. So