What is described by a runtime complexity of O$(1)?$

$*$

$2$ points

Algorithm efficiency is independent of the problem size, and is the fastest

There is a limit on performance

Memory use is inefficient

Constant $1$ needs to be removed