Cluster the following six points $($with $($x$,$ y$)$ representing locations$)$ into two clusters A$1(1,1)$ A$2(8,10)$ A$3(4,4)$ A$4(3,6)$ A$5(10,8)$ A$6(6,5).$ Initial cluster centers are A$1(1,1)$ A$3(4,4).$ Using Euclidean distance. Assume the initial two centers are C$1=$A$1,$ C$2=$A$3.$

Use k$-$means algorithm to find the two cluster centers after the two iterations.