The plane sweep algorithm utes a priority queue instead of a sorted set to keep track of the potential sweep line x locations because
(choose all that apply)
Select one or more
a. a we repeatedly remove the minimum value and that is not necessarily supported
by a sorted sut
b. we like to save space and a prionty quetie uses less space asymptotically than any sorted set implementation we know of I
c. we need to add points as the algorithm proceeds and this is asymptotically faster for a prority queue