2. Perform k-means algorithm on the dataset given below. The two red dots are the initial random centroids and there are ten data points. In the first sub-graph, the decision boundary is drawn according to cluster centers. In each sub-graph, firstly, determine the new cluster centers based on the classification given in the previous sub-graph $ 2 1 $ . 4 10 4 6 k 4 6 . 1 C 7 S 6 6 ** 4 WI 4 6 4 3 $ 6 M 2 A 2 . 44 . . . 5 S 6 O 6 4 7 " W