$1-$ K$-$Means Clustering $(30$P$)$

Given the dataset below with two features, cluster the data into $2$ clusters using the K$-$Means algorithm. Assume the initial centroids are:

Centroid $1$: $(2\mathrm{.}1,6\mathrm{.}2)$

Centroid $2$: $(1\mathrm{.}6,3\mathrm{.}3)$