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

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

}

}