need accurate answer, please.

Al=(2+x1,10),A2=(2+x2,5),A3=(8+x3,4),A4=(5+x4,8),A5=(7+x5,5),A6=(6+x6,4) where the Euclidean distance between (x,y) and (x,y) is (xx)2+(yy)2. Suppose that the initial centroids (centers of each cluster) are (0,0) and (5,5). Run the k-means algorithm for 1 iteration only. At the end of this iteration show: a) [15 Points] The new clusters (i.e. the data points belonging to each cluster) b) [5 Points ] The centers of the new clusters