Why do we use a linear search instead of a binary search when there are relatively few items in an array-based sorted list?

Question options:

1)	We never use a linear search instead of a binary search.

2)	A binary search requires more operations per iteration; it is slower than a linear search in this case.

3)	A linear search has a faster complexity class when lists are short.

4)	A linear search performs less iteration than a binary search.