Company SuperHiTech has invented a new material. They want your help to deter$-$

mine the largest integer N so that if a plate made up of this material is dropped from N

feet, the plate will not sha$$er$.$ Addi$$onally$,$ because the material is expensive, they don$$t

want you to sha$$er many plates in the process of determining N $.$

One op$$on you thought of is to use binary search $($see pages $142-144$ of your book$).$ Sup$-$

pose the folks at SuperHiTech knows that N $<=1024.$ Then you start with h $=512$ and drop

a plate. If it sha$$ers N in $[1,511]$; else N in $[512,1024].$ Suppose it sha$$ers$,$ you drop the

plate at h $=256$ to further narrow down the value of N $.$ When N is small $($which will dis$-$

appoint the company$),$ no$$ce that a binary search for N will end up sha$$ering many plates.

You need a different strategy.