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

$x=[(7,11),(16,20),(28,26),(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 centres of clusters and calculations for each iteration in your answer. You can use the Euclidean distance to calculate the distance between points.