Give the best running time of the code below use big-O or big-Theta.

void fun6(n)

if(n

return

else

fun6(n/2)

fun6(n/2)

fun3(n) // fun3(n) = theta(nlogn)

fun6(n/2)

fun6(n/2)

-------------------------------------

Tried to use the master theorem, but I am not sure what is d in here.

Please use the master theorem below when you solve the problem.

Please notice that no epsilon here!

T(n) = nifd > log b", d = = exponent)