Let S be a set of n vertical line segments in the plane. A line l that intersects all segments of S is called a stabber for S. Design an algorithm with O(n) expected running time that will find a stabber line for a given set S. If no stabber exists for a set S, your algorithm should report this fact. Do not try to design a completely new algorithm. This question can be solved easily by using some of the algorithms we have learnt in this class. You do not give the details of the existing algorithms you use. Just give a high level description of your solution.