Need help with computer science question, need to check work so please make sure answer is correct, thanks:)

Which of the following are FALSE? Select all that apply. The best case time complexity of linear search is O(1) and occurs when there is just one element in an array The worst-case time complexity of binary search in an array of n integers is O(log(n)) If the growth rate for algorithm A can be represented by T(n)=n and the growth rate for algorithm B can be represented by U(n)=log(n) we can say that algorithm A is faster than algorithm B. As an array gets larger and larger ( n infinity) the clocked time it takes to execute the binary search algorithm will get larger and larger