If a sorted array is rotated by k positions, what is the time complexity to find the starting point of the original array?
A. O(logn)
B. O(1)
C. O(n)
D. None of the above