Select the following statements that are true. The worst-case complexity of the linear search algorithm is (n) The worst-case complexity of the bubble-sort algorithm is O(n2). f(n)=(2f(n)) f(n)=(g(n)) if and only if f(n)=O(g(n)) and f(n)=(g(n)). The average-case complexity of the linear search algorithm is O(logn)