Question 2 (The Skyline Problem, 30 points). A city's skyline is traced out by n rectangular buildings. In particular, each building has a height hi and a base given by an interval [xi, For our purposes we will assume that the r and y used by the n buildings are ezactly the integers from 1 to 2n without any repeats. The height of the skyline at location at a position i is given by maxia, Give an algorithm to compute l,&2,, L2n For full credit, your algorithm should run in time O(n log(n or better. Hint: use divide an conquer. Your subproblems may need to look slightly more complicated than your original problem. Question 2 (The Skyline Problem, 30 points). A city's skyline is traced out by n rectangular buildings. In particular, each building has a height hi and a base given by an interval [xi, For our purposes we will assume that the r and y used by the n buildings are ezactly the integers from 1 to 2n without any repeats. The height of the skyline at location at a position i is given by maxia, Give an algorithm to compute l,&2,, L2n For full credit, your algorithm should run in time O(n log(n or better. Hint: use divide an conquer. Your subproblems may need to look slightly more complicated than your original