Consider the following recursive function: unsigned int foo(unsigned int n) int i, tralalala pointless far_loopD if (n 2) return 5; tralalale paintless for loap++ return foo[n-2); Which of the following recurrence relations most accurately represents the runtime of this function? a) Initial Condition: T(0) T(1) Co Recurrence: T(n)-5+ n for n 2 b) Initial Condition: T(O) T(1) Co Recurrence: T(n) 5Tn) forn 2 2 c) Initial Condition: T(O)T1) 5 Recurrence: T(n) = 5 + n for n 2 d) Initial Condition: T(O)(1)Co Recurrence: T(n) = c1 + n for n 2 Initial Condition: T(O) = T(1)- Recurrence: T(n) = c1 + T(n) for n-2 e) Initial Condition: T(O) = T(1)-CO Recurrence: T(n) = c1 + T(n-1) for n 2 g) Initial Condition: T(O) = T(1)-co Recurrence: T(n) = c1 + T(n-2) for n 2 Initial Condition: T(O) = T(1) = co Recurrence: Tn)-cn Tn) for n 2 2 i) Initial Condition: T(O) T(1) Co Recurrence:T(n) c1Tn-1) for n 2 2 Initial Condition: T(0) = T(1) = co Recurrence: Tn)- C1nT(n-2) for n 2 k) Initial Condition: TO)1)Co Recurrence: T(n) = c1 + n + 2-T(n-1) for n 2