Can you search the following array using binary search?

int[] A = {6,5,4,2,0,1,-1,-17};

a. No. Binary search can be applied to a sorted array only.
b. Yes. Binary search can be applied to any array.
c. Yes, but the algorithm runs slower because the array is in descending order.
d. No, negative numbers are not allowed because they indicate that a value is not present.

It should be b i believe

Ithink the answer is d but not sure. sorry.

Choice 2.the algorithm constantly checks to see if the value in the position before is greater than the value in the current position. if there is even one instance, it will return false and stop looping.using an if-statement without } and { means that the if-statement true condition only applies for the next lineconsider  . the condition  checks if previous position is greater than or equal to current position. if it is, it will make method return false. for that example, it won't.consider  , it would return falseconsider  . it would return false