A type of algorithm that is bounded by a constant and is not dependent on the size of the problem is called (Blank) .
a. linear time
b. quadratic time
c. bounded time
d. logarithmic time
e. exponential time