Find the big O run times of these recursive functions using Recurrence relations and general characteristic equations with respect to n

void sithLord(int n)

{

if( n <= 200 )

time += 700;

else

{

sithLord((7*n)/10);

for(int i=0; i

time++;

sithLord(n/5);

for(int i=0; i<130*n; i+=10)

time++;

}

}