In the following function, how many recursive calls are there?

void towers(char source, char dest, char help, int numDisks)
{
if(numDisks<1)
{
return;
}
else
{
towers(source,help,dest,numDisks-1);
cout << "Move disk from " << source << " to " < towers(help,dest,source,numDisks-1);
}
}
a. 0
b. 1
c. 2
d. 3

c. 2