Define a function

bool search$($int nums$[],$ int length, int target, int & first, int & last$)$

$\{1,2,2,2,4,7\}$

the function should immediately return false.

to the target. For example if the array were size $1024$ and the target occurred $5$ times, then your code should access the array no more than log $2(1024)+5=10+5=15$ times.

values in the event that target is not found in the array.

int main$()\{$

int nums$[6]$;

int length;

cin $>>$ length;

for $($int i $=0$; i $$ length; i$++)$

cin $>>$ nums$[$i$]$;

int first $=-1,$ last $=-1$;

bool b $=$ search$($nums$,$ length, $5,$ first, last$)$ ;

cout $$ first last $""$ b $$ endl;

return $0$;

$\}$