Three eggs, 100 floors

You have 3 identical eggs and a 100-floor building. There is a floor $f^*$ such that an egg dropped from floor $f^*$ or above breaks, and one dropped from below $f^*$ survives and can be reused; the egg might also survive every floor. What is the minimum number of drops that guarantees you find $f^*$ in the worst case? Which floors can the first drop be made from without losing that guarantee?