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

void strass(int n){

if( n<=18 )

time++;

else {

strass(n/2);

strass(n/2);

strass(n/2);

for(int i=0; i

for(int j=i; j

time++;

strass(n/2);

for(int i=n/2; i

time ++;

strass(n/2);

strass(n/2);

strass(n/2);

}

}

void jedi(int n){

if( n <= 147 )

time += 54;

else{

for(int i=0; i

time++;

jedi(n/3);

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

time++;

jedi((2*n)/3);

}

}

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++;

}

}

void hanoi(int n)

{

if( n==1 )

time++;

else

{

hanoi(n-1);

time++;

hanoi(n-1);

}

}