plese provide code in python or java

Q6 Cluster the following e1ght points into three clusters with features (x,y) : 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. 1. Write a program that uses the kmeans algorithm to show the final three clusters. You can use any programming language. For each iteration, you need to output the distance and the group matrix values. 2. Use the median value as your centroid and show the final three clusters. For each iteration, you need to output the distance and the group matrix values. 3. Comment on the result