PROBLEM 2: algorithm design (50 points): You are given as set of n time intervals(ses.e...seThe interval (s,e,) has a start time of s, and an ending time of e You can think of each interval indicating that a "process" is active during that time. You may assume that es or you can just think of them as horizontal line segments. You want to find the maximum overlap among all of the given time intervals. Your algorithm simply determines this maximum value and reports it. The diagram below 1llustrates an instance of the problen with 6 time intervals, each represented by horizontal line segments. For this instance, the algorithm would report 4 as the maximun overlap. end start overlap overlap: overlap: overlap: overlap: time Devise an algorithm solving this problem in O(n logn) time. Discussion/details: if one interval ends at exactly the same time another begins, the two intervals are overlapping. . Time intervals are inclusive of their end points. As a result, The interval start and end times are given as floating point numbers . The intervals are given in an arbitrary order