Question $8(30$ points$)$: $(35$ points$)$ Given the centroids A$,$ B$,$ and C as shown in the figure

below, use your knowledge of the k$-$Means algorithm to fill out the table by computing the

Euclidean distance from each point to each centroid. Use your calculations to assign each

point to the most appropriate cluster. Once you have filled out the table, recompute the new

centroids. Show your work. Repeat the process of assigning clusters and computing

centroids until the centroids converge $($i$.$e$.,$ until the same centroids occur in successive

iterations$).$