To calculate the factorial of a function the following recursive function can be used. def factorial$($n$)$:

if $n=0$ :

return $1$

else:

return $n**$ factorial$($n$-1)$

How many times will the function be called to calculate the factorial of $5?$

a$)6$

b$)5$

c$)4$

d$)3$

The following binary$\_$search function is used to find a target in a sorted list.

def binary$\_$search$($data$,$ target, low, high$)$:

$""\text{'}$Return True if target is found. $"""$

if low$>$high:

return False

else:

mid $=($low$+$high$)\frac{\frac{?}{?}}{2}$ #division floor

if target $==$ data$[$mid$]$: #found a match

#base case

return True

elif target$=4n=$len$0,n-1$ data $=[2,4,7,8,9,12,14,17,19,22,25,27,28,33,37]$

target $=4$

$n=$len $(data)$

print$(binar{y}_s$earch$(data,$ target, $0,n-1))$

What will $be$ the value $of$ 'mid' $at$ the second $binar{y}_s$earch function call?

$a$