Which of the following Big O notations is appropriate for the complexity of a search algorithm?(1 point)
Responses
O(1)
upper O left parenthesis 1 right parenthesis
O(n2)
upper O left parenthesis n squared right parenthesis
O(n)
upper O left parenthesis n right parenthesis
O(logn)