Given a sorted array, how can you find whether two elements sum to a target in O(n) time and O(1) space?