Rotated sorted array

Computer Science Level 2

An element in a sorted array can be found in $O(\log_2 n)$ time by using binary search. Now assume you are given a sorted array of $n$ integers that has been rotated many times. Is it possible to find an element in the array in $O(\log_2 n)$ time?

Yes Only when he number of rotations is known No Only if the array is sorted in ascending order Only if the array is sorted in decending order