Each level in a completely filled binary call tree has

a$.$ four times as many calls as the level above it

b$.$ three times as many calls as the level above it

c$.$ twice as many calls as the level above it

d$.$ the same number of calls as the level above it