Describe a linear time algorithm that, given

$$ An unsorted array A of n comparable elements

$$ A designated array element x

$$ An integer k between $1$ and n$-1.$

Page $2$ of $2$

Finds the k elements of A closest to x$.$ For example, given the

array A$=[6,2,7,1,4,5,4],$ the k$=4$ elements closest to x$=5$ are $4,4,$

$5,$ and $6$