Answer the following statements true (T) or false (F)

1) Linear search is faster and more complex than the binary search.
2) Searching data involves determining whether a search key is present in the
data and, if so, finding its location.
3) A linear search algorithm will always search each and every element.
4) The Big O Notation measures the average case run time of an algorithm.
5) O(1) means that the algorithm has a constant run time.

1) F
2) T
3) F
4) F
5) T