Not entirely sure if answer is correct.

10 1 point Given the following pieces of code, choose the Big O complexity. If there is more than one option, select the tightest asymptotic bound. 1 Find the zero-based position of the given value within the sorted vector templatectypename T> std::size_t find( const std::vector & collection, const value [ auto renainingcandidates - collection.size(): auto midpoint = remainingcandidates/2 while remainingCandidates + if value == collection midpoint]) return midpoint; if( remainingCandidates - 1 break; 11 If there is only one remaining candidate // and it's not the one we're looking for, well... Il rounding the result allows for odd number of candidates remainingCandidates = ( remainingCandidates - 1) / 2; // adjust either forward or backward by half the candidates remaining IF( value