If you have two eggs and a 100-storey building, find the minimum number of the storey to determine where the eggs break.
Implement two_egg_drop(floors) to return the minimum worst-case number of drops needed to identify the highest safe floor when exactly two eggs are available. Eggs that survive may be reused, and broken eggs cannot be reused. Return 0 when floors is 0.
Example: two_egg_drop(100) returns 14, because 14 * 15 / 2 >= 100 and 13 * 14 / 2 < 100.
def two_egg_drop(floors):