Problem 4 Given a set of n open intervals on R defined by (a,b),(a,b)....(a,b) Each a represents the beginning time of a process, and represents the termination time of the process. There is an open interval (z,y) where the greatest number of processes is active. What are the and y of such an interval. Consider the example given in Figure 1. 0.11) Is = (3.12) 1(1.8) (10.14) 6 7 . 10 Figure 1: Intervals (1,8), (6,9), (10,14), (7,11), (3, 12). Maximum activity is in the interval (7.8), where four jobs are active. 1. Give a brute-force algorithm to solve this problem, with a worst case running time of en'). 2. Provide the time complexity analysis. Problem 4 Given a set of n open intervals on R defined by (a,b),(a,b)....(a,b) Each a represents the beginning time of a process, and represents the termination time of the process. There is an open interval (z,y) where the greatest number of processes is active. What are the and y of such an interval. Consider the example given in Figure 1. 0.11) Is = (3.12) 1(1.8) (10.14) 6 7 . 10 Figure 1: Intervals (1,8), (6,9), (10,14), (7,11), (3, 12). Maximum activity is in the interval (7.8), where four jobs are active. 1. Give a brute-force algorithm to solve this problem, with a worst case running time of en'). 2. Provide the time complexity analysis