too high - too low - correct the correct number is identified in only seven guesses this is the maximum you might get lucky and guess the number before you've worked your way all the way down to range of one this would happen if the number to be guessed was for exampleor binary search in the ordered workshop applet to perform binary search with the ordered workshop appletyou must use the new button to create new array after the first press you'll be asked to specify the size of the array (maximum and which kind of searching scheme you wantlinear or binary choose binary by clicking the binary radio button after the array is createduse the fill button to fill it with data items when promptedtype the amount (not more than the size of the arraya few more presses fills in all the items once the array is filledpick one of the values in the array and see how the find button can be used to locate it after few preliminary pressesyou'll see the red arrow pointing to the algorithm' current guessand you'll see the range shown by vertical blue line adjacent to the appropriate cells figure depicts the situation when the range is the entire array at each press of the find button the range is halved and new guess is chosen in the middle of the range figure shows the next step in the process even with maximum array size of itemsa half-dozen button presses suffices to locate any item try using the binary search with different array sizes can you figure out how many steps are necessary before you run the appletwe'll return to this question in the last section of this notice that the insertion and deletion operations also employ the binary search (when it' selectedthe place where an item should be inserted is found with binary searchas is an item to be deleted in this appletitems with duplicate keys are not permitted figure initial range in binary search