in a linear search algorithm, what is the worst−$-$case scenario?

36$36$

A.$.$

When key is the last element in array

B.$.$

When key is not found in array

C.$.$

When key is the first element in array

D.$.$

Both A & B