Show two iterations of k-means clustering algorithm for these data points. Assume that k=3 and initial cluster means are (5,8) ; (4;3) ; (7,1).

Show two iterations of k-means clustering algorithm for these data points. Assume that k=3 and initial cluster means are (5,8) ; (4;3) ; (7,1). Give cluster means and cluster contents after each iteration.

b) Show two iterations of k-medoid clustering algorithm for these data points. Assume that k=3 and initial cluster medoids are (5,8) ; (4;3) ; (7,1). Give cluster medoids and cluster contents after each iteration.

c) Apply bottom-up hierarchical clustering algorithm for these data points using

 Single linkage (nearest neighbor).

 Complete linkage

 Group average linkage.

Draw dendrogram graphs showing the sequence of how sub-clusters are merged together with the lifetime information (defined as the difference between the distances at two successive nodes).