Question $2$ of $2$

$(3)$

For an algorithm with a space complexity of $O(1),$ what does this indicate about its memory usage as the input size increases?

Constant memory usage regardless of input size

Memory usage grows logarithmically with input size

Exponential growth in memory usage with input size

Memory usage grows linearly with input size