Consider the following eight points in a 2-dimensional space: {(2, 10); (2, 5); (8, 4); (5, 8); (7, 5); (6, 4); (1, 2); (4, 9)}. Suppose we plan to use the Euclidean distance metric, and we are interested in clustering these points into 3 clusters. a. Plot the data points to see what appropriate clusters might be; b. Form three initial clusters with points {(2, 5), (5, 8), (4, 9)} as initial cluster centers; c. What’s the center of the cluster after one iteration? d. How many iterations are required for the clusters to converge? e. What are the resulting centers and resulting clusters? (K=3)