Identify the algorithm strategy employed by a program that searches a sorted array by comparing the target value to each value in the array, until the target value is found or until the all values have been compared.

$$ none of these

O greedy

$$ dynamic programming

O brute force

O divide and conquer