Question $3$

Consider the following algorithm for searching for a target integer $k$ among an

array of $n$ integers. The first input is the target integer $k,$ followed by an integer

size $n,$ followed by $n$ additional input integers.

$//$ Declare and read inputs

integer $n$

integer $z$

integer array$(?)$ A

integer i

integer flag

$n=$ Get next input

$k=$ Get next input

$A.$ size $=n$

$i=0$

while $i=i+1n=12$

$k=2$

$A=[5,7,1,9,1,4,7,8,9,9,1,2]k=2k=2$