When we write the recurrence relation for the pseudocode, what would be the a, b, and c parameters in the recurrence relation? a- be C- DivideAndConquer (points) if len(points) == 1 return points first - DivideAnd Conquer (points[0..len(points)/3] ). middle - DivideAndConquer ( points[len (points)/3.2"len(points)/31 ) last = DivideAndConquer ( 2*points[len (points)3.. len(points)] ) return merge(first, middle, last) H/complexity of the merge method is O(n) 3