2. (30 marks) You are asked to use the k-means algorithm to cluster the following 8 examples into 3 clusters: P1=(2,10), P2=(2,6), P3=(8,4), P4=(5,8), P5=(7,4), P6=(6,4), P7=(1,2), P8=(4,9). (a) Compute the distance matrix based on the Euclidean distance. (b) Suppose that the initial seeds (centroids of each cluster) are A1, A4 and A7. Run the k- means algorithm for 1 iteration ONLY and then write down: i) The new clusters (i.e. the examples belonging to each cluster) ii) The centroids of the new clusters