Please see an attachment for details Image transcription textBinary Search is a quick search strategy. If we have a sorted collection of 100

Please see an attachment for details Image transcription textBinary Search is a quick search strategy. If we have a sorted collection of 1000 items, how many ‘probes’ or’tests’ are required to locate an item in the collection? O 500, you need to search 1/2 of the collection onaverage O about 10 0 3 O Up to 1000, it depends on where the item is in the collection… Show more  Computer Science Engineering & Technology Java Programming CSSE 2002 Share QuestionEmailCopy link