1. Apply K-medoids clustering algorithm to partition the following points into 3 optimal clusters: A(2, 10), B(2, 5), C(8, 4), D(5, , E(7, 5), F(6, 4), G(1, 2), H(4, 9) Consider the points A(2, 10), D(5, and G(1, 2) as the Initial Medoids. Use the Euclidean distance function to measure the dissimilarities. Finally, show the 3 optimal clusters in a scatter plot of the points.

please solve it properly