Which of the following search algorithms is represented by the pseudocode?

index = 0

WHILE (index < number of items in the list)

{

IF (list[index] == target element)

{

RETURN index

}

index = index+1

}
(1 point)
Responses

binary search
binary search

hashing
hashing

quicksort
quicksort

linear search
linear search