Suppose that the data mining task is to cluster points (with (x, y) representing location) into three clusters, where the points are a1(2,10),a2(2,5),a3(8,4),b1(5,8),b2 (7,5),b3(6,4),c1(1,2),c2(4,9). the distance function is euclidean distance. suppose initially we assign a1, b1, and c1 as the center of each cluster, respectively. use the k-means algorithm to show only (a) the three cluster centers after the first round of execution. (b) the final three clusters.