For a givenset of ime se STUDY PROBLEM 5 sw wbere he sweping lines (he verical ie) ould boe what is inserted and removed from the Binary Search Tree at each line, and which segments are compared at that sweeping line. STUDY PROBLEM 6 a) For the given set of points on the right, show in which order the points are analyzed in Graham's scan method? b) Why the lines 7-10 in Graham's scan method in slides have O(n) complexity? 7 fori 3 to m 8 while the angle formed by points NEXT-To-ToP(S), TOP 9 and pi makes a nonleft turn PoP(S) PUSH(P. S) 10