We have a decider whose inputs are binary strings. Say A is an input to B with n bits. What can we say about the number of steps required for B to decide A? (Choose the most specific answer.)
a) It's polynomial in n
b) It's exponential in n
c) It's logarithmic in n
d) It's linear in n