What is the asymptotic complexity of the following functions? Justify the answers.

*answer both Recurrence Relation and Complexity in Big-Oh*

a.)

b.)

c.)

int powerRL int x, int n) { if (n==0)| return 1; if(n==1) return x; if (n is even) return powerBLX x, n/2); else return powerBLX * x, n/2) x, n/2 ) * x ; } * x int azaxddd lint A[], int n) { if (n