Your task is to determine the highest floor of a 'n' floor building from which an egg can be dropped to the ground without breaking. Assume that the ground is floor zero. Assume that the floors of the building are numbered from 1 to n. Write and Analyze the Worst Case of the best algorithm you can think of, that minimizes the total number of drops you will have to make, if you had: a. only one egg b. two eggs c. (BONUS) 'k' eggs. Assume: k << n. Note that you must design an algorithm and analyze its worst case complexity.