The worst$-$case time complexty of Linear Search occurs when$-$

la$.$ The target element is not present in the array or is present at the last postion

b$.$ The target element is found at the end of the amay

c$.$ The target element is found at the begining of the array

d$.$ The array is sorted in ascending order