procedure findInsertLoc$($x: integer, a$1,$ a$2,...,$ an: sorted in non$-$decreasing order integers$)$

k :$=1$

while $($k $<=$ n and ak $<$ x$)$

k :$=$ k $+1$

return k

Hand trace: findInsertionLoc$(15,0,3,8,10)$

Provide the following based on this call to findInsertionLoc:

the value stored in n

the value of k each time the while loop's conditional expression is executed $-$ so if the conditional is executed $3$ times, you must list the value of k for each of those $3$ times

the value returned