In a linear search algorithm, each element of the array is checked sequentially until the target element is found or the entire array is traversed. In the worst-case scenario, the target element is either at the end of the array or not present at all. Thus, the time taken is proportional to the size of the array ((n)). \[\] Correct Option: (a)