implementation$)$ Suppose that we are given a sorted list of integers, and we are interested in finding

the k$-$nearest neighbors to a given target value. For instance, for A $=[10,15,17,18,20,21],$ k $=4,$ and target $=14,$ the return

value would be kNearest $=[10,15,17,18]($note that the returned sub$-$array, kNearest, should have the same ordering of the numbers

as in the original array$).$

$($a$)$ Implement the naive approach for this problem with O$($n$)$ run time, which traverses the values in the array until Ai $>$ target,

and returns k values in the vicinity of Ai$.$ Sample function call and expected inputs$/$outputs are provided below.

$1$ # inputs are identical to the ones provided in the problem description

$2$ kNearest$\_$naive $=$ get$\_$k$\_$nearest$\_$naive$($A$,$ target, k$)$

$3$ # kNearest$\_$naive $=[10,15,17,18]$ write the code in python