Which recurrence best describes the work in the divide-and-conquer algorithm for closest points AFTER realizing that there are at most a constant number of points on or near the dividing line that could be closer than the minim distance detected so far? a. T(n) = T(n/2) + θ(n)
b. T(n) = T(n/2) + θ(n^2)
c. T(n) = 2T(n/2) + θ(n)
d. T(n) = 2T(n/2) + θ(n^2)
e. T(n) = T(n-1) + θ(n)
f. T(n) = T(n-1) + θ(n^2)
g. T(n) = 2T(n-1) + θ(n)
h. T(n) = 2T(n-1) + θ(n^2)

Per the previous question, what is that upper bound on the constant number of points that can be on the mid-point line or just on the other side of it, such that they are closer to a given point than the minimum distance detected so far on either side of the mid-line?