$1.$ A$)$ Consider the $1-$dimensional data set with $10$ data points $\{1,2,3,...10\}.($Data point A has a value of $1,$ Data point B has a value of $2,...)2,$ Show three iterations of the k$-$means algorithms $($Euclidean function$),$ when k $=$ and the random seeds are initialized to $\{1,2\}.(12$ pts$)$ B$)$ Has the clusters converged? $(3$ pts$)$