Question 22 2 pts A(n) search is a search algorithm that starts from the beginning of a list, and checks each element until the search key is found or the end of the list is reached. Linear Binary Divide and Conquer