1) Farthest Points 1-D (Pre-Sorted)

What is the time complexity required to find the FARTHEST pair of points in one dimension (y-coordinate is zero), where the points have ALREADY been sorted by their x-coordinate?

A) (1)

B) (log n)

C) (n)

D) (n log n)

E) (n^2)

F)(n^3)

2) Farthest Points 1-D (Not Pre-Sorted)

What is the time complexity required to find the FARTHEST pair of points in one dimension (y-coordinate is zero), where the points have NOT already been sorted by their x-coordinate and the points have arbitrarily large precision (counting-type sorts not applicable)?

A) (1)

B) (log n)

C) (n)

D) (n log n)

E) (n^2)

F) (n^3)

Please, include explanation with the answer.