Hierarchical clustering. Consider a data set that contains 4 data points, with a pairwise Euclidean distance as follows: Draw the dendrograms below using MIN and MAX as specified. For the ( x )-axis please use ( a, b, c ), and ( d ) to denote the data points as shown above in the matrix, and use the distance for the ( y )-axis. (a) ( [10 ) points] Split the data points into two clusters using complete-linkage (MAX) hierarchical clustering. Draw the dendrogram to show the process of clustering and show the resulting clusters. Answer: (b) ( [10 ) points] Split the data points into two clusters using single-linkage (MIN) hierarchical clustering. Draw the dendrogram to show the process of clustering and show the resulting clusters. Answer: