1. 4 points are given. A=(2,3),B=(6,8),C=(5,4),D=(3,9). Determine by showing proper steps if AB and CD edges intersect. 2. Given that ABCDE and PQRST are two pentagons. Two pentagons intersect only if their edges intersect. To determine whether the above two pentagons intersect or not, how many calls to the "segment_semgment_intersection" algorithm are necessary? If we used n-sided polygons instead of pentagons, how many calls would we need