Letting k be the number of indices i such that A$$i$$ D x$,$ give the worst$-$case and

expected running times of SCRAMBLE$-$SEARCH for the cases in which k D $0$

and k D $1.$ Generalize your solution to handle the case in which k $1.$