Write an algorithm in plain English. The Computer Science department is moving into a new building with n floors, and the professors are given a task of determining the "lethal heistht" of the building, ie, the floor x where people falling from it or above will die while people falling from floor x - 1 or below will not. They have only one resource their own lives. A simple algorithm is to ask a professor to try jumping out of each floor (starting from the bottom) until he or she dies. Assuming many professors are willing to help, give an algorithm in plain English that only takes o(logo) jumps. Also, specify what kind of procedure/search) you are using. (Use some mathematical notation for better understanding)