D$)$ Consider a dataset consisting of $6$ data$-$points: $,68.$ Apply $k-$means clustering algorithm with $k=2$ using Euclidean as the distance measure over this dataset up to two iterations and show the clusters. Initially choose first two data$-$points as initial centroids.