You are given five different data points, p1, p2, p3, p4, p5. Use the similarity matrix in Figure 2 to perform complete link hierarchical clustering. a) For each of the four merging steps, show the updated proximity matrix of the clusters. b) Visualize the clustering solution using a dendrogram. The dendrogram should clearly show the order in which the points are merged, and the distances between the clusters merged. c) Which clusters are formed if we need to have two clusters? Note: while the proximity table that is given to you has similarities, you can easily transform them into distances if you compute d = 1 - s.

You are given five different data points, p1, p2, p3, p4, p5. Use the similarity matrix in Figure 2 to perform complete link hierarchical clustering. a) For each of the four merging steps, show the updated proximity matrix of the clusters. b) Visualize the clustering solution using a dendrogram. The dendrogram should clearly show the order in which the points are merged, and the distances between the clusters merged. c) Which clusters are formed if we need to have two clusters? Note: while the proximity table that is given to you has similarities, you can easily transform them into distances if you compute d = 1 - s.