Write a program in python for the above. (Use Python Only). The solution needs to be with Time Complexity Theta(n*log(n)) or lower.

Task 2: The Skyline Problem (Contents and images taken from [1) The skyline problem is defined as given n rectangular buildings in a 2-dimensional city, compute the skyline of these buildings, eliminating hidden lines. The main task is to view buildings from a side and remove all sections that are not visible. All buildings share common bottom and every building can be represented by triplet (Left, Height, Right) [1] . Left: is x coordinated of left side, . Height: is height of building . Right: is x coordinate of right side. 10 For example, above building is represented as (1,11,5) A skyline is a collection of rectangular strips. A rectangular strip is represented as a pair (left, height) where; . Left is xcoordinate ofleftside of strip Height: is height of strip