b$)$ Use the K$-$means clustering to find two different clusters in the following sequence of two$-$finensionel points;

$x=[(7,11),(18,20),(28,28),(18,10),(13,19),(22,29),(32,21),(12,15),(38,2),(3,4)]$

Choose two random centres for your clusters to start the algorithm. Include the gentres of clusters and calcilations for each iterations in your answer. You can use the Euclidean distance to cilculate the distance between points.