Let R be a set of n red points in , and let B be a set of n blue points in . We call a quadratic curve a separator for R and B if has all points of R to one side and all points of B to the other side. Give a randomized algorithm that can decide in O(n) expected time whether R and B have a separator. (Use linear programming). **It is for a curve, not a line**