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

a$.$ The target element is not present in the array or is present at the last position

b$.$ The array is sorted in ascending order

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

d$.$ The target element is found at the end of the array

Clear my choice