1) Prepare one example for each case of the Master Theorem (different from the examples given in class) by giving the recurrence relation and then applying its formula to find the complexity. 2) Write the recurrence relation for the below pseudo-code: DivideConquer(points) if len(points) == 1 return points left_half = DivideConquer ( points[0..len(points)/2]). right_half = DivideConquer ( points[len(points)/2.. len(points)]). return merge(left_half, right_half) // complexity of the merge method is O(n)