What does the Big O complexity notation O$($n$)$ mean?

$*$

$2$ points

It means the algorithm requires data input of size n

It means the algorithm efficiency is proportionate to the problem size of the input data or n

It means the algorithm uses memory of size n

It means the algorithm has an integer n performance