Hw 1: a) Exists c>0 such that given a point set with n points and a line family with n lines, we can select cn points and cn lines
such that all the selected points are in the same cell (i.e. no two are separated by a selected line).
b) Using the above, prove that exists c>0 given n segments and n lines we can select cn of each such that
selected lines are segments either all intersect, or none of them do.
c) Using the above, prove the same for n red and n blue segments.
Hw 2: Prove that in the Second selection lemma in 1-dim s=2 (upper and lower bound)!