$3.$ Suppose that we apply the k$-$means algorithm on the dataset

$1<(-5,-5)>,<(-5,5)>,<(5,-5)>,<(5,5)>$;$,$ with K$=2$ and initial seeds at $(0,4)$ and $(0,-4),$ and with Euclidean distance.

a$.$ What are the two centroids and two clusters after the $1$s iteration of the k$-$means algorithm $(8$ points$)?$

b$.$ What are the two centroids and two clusters after the $2$nd iteration of the k$-$means algorithm $(8$pts$)?$