Which of the following is true about binary and linear searches? A linear search iterates through the entire array one by one while a binary search repeatedly divides in half a portion of the array that could contain the item. In general, a binary search is faster than a linear search. A binary search always begins at the first element of an array. A linear search always begins at the middle element of an array