In algorithmic analysis, what does "worst$-$case time complexity" represent?

a$.$ The longest time an algorithm takes for any input

b$.$ The average time an algorithm takes for typical inputs

c$.$ The best time an algorithm takes for small inputs

d$.$ The time an algorithm takes in the best$-$case scenario