You are given two sets of points in the plane, a red set R containing n_r points and a blue set B containing rib points. The total number of points in both sets is n(= n_r + n_b). Give an O(n) (expected) time algorithm to determine whether the convex hull of the red set intersects the convex hull of the blue set. If one hull is nested within the other, then we consider them to intersect. You are given two sets of points in the plane, a red set R containing n_r points and a blue set B containing rib points. The total number of points in both sets is n(= n_r + n_b). Give an O(n) (expected) time algorithm to determine whether the convex hull of the red set intersects the convex hull of the blue set. If one hull is nested within the other, then we consider them to intersect