c$.$ The code fragment below computes a permutation of $n$ items repeated $r$ times. The argument perm is a permutation on $n$ elements represented as a list of $n$ indexes, so that perm is interpreted to be the permutation that maps index $1$ to index $p[1].$Let T$\_($R$)($n$,$r$)$ represent the $($worst case$)$ time complexity of invoking repCombine $($perm$,$ reps$)$ where n is the length of the permutation, perm, and r is the value of reps. Using the set $\{+,-,**,////,\%,==,$ range, append, for iterator $\}$ as the basic operations under consideration:$($i$)$ Let T$\_($C$)($n$)=$ Time$[$combine$($p$1,$ p$2)]$ where both p $1$ and p $2$ have lengths n$.$ Determine the exact expression for T$\_($C$)($n$).($ii$)$ Develop, and simplify, a recurrence relation for T$\_($R$)($n$,$r$).($Your final answer should be expressed in terms of n and r $).$ Please note that you are not being asked to solve the recurrence.