3. Alice has recently started working on the Los Angeles beautification team. She found a street and is proposing to paint a mural on their walls as her first project. The buildings in this street are consecutive, have the same width but have different heights. She is planning to paint the largest rectangular mural on these walls. The chance of approving her proposal depends on the size of the mural and is higher for the larger murals. Suppose n is the number of buildings in this street and she has the list of heights of buildings. Propose a divide and conquer algorithm to help her find the size of the largest possible mural and analyze the complexity of your algorithm. The picture below shows a part of that street in her proposal and two possible location of the mural: +