Design a deterministic algorithm, that is, one that doesnt make random choices, to compute the trapezoidal map of a set of non-crossing line segments. Use the plane sweep paradigm. The worst-case running time of the algorithm should be O(nlogn).