Consider a 1-dimensional data set [1. 2. 3, 10, 20, 30, 40, s0, 100, 200, 300, 4001 and apply Agglomerative Hierarchical Clustering (Single Link). Ties are cases where multiple pairs of clusters have the same (minimum) distance. We assume that ties are broken by merging, among the pairs of clusters with minimum distance, the pair of smallest clusters i.e. those with the smallest number of elements), or if there are still several of them, the pair of clusters with the smaller elements. (a) Apply Agglomerative Hierarchical Clustering (Single Link) to this data set. Show the resulting dendrogram, in particular the series of all merges. (b) Cut the dendrogram resulting from (a) so that you obtain 3 clusters. Show these 3 clusters. (c) Cut the dendrogram resulting from (a) so that you obtain 6 clusters. Show these 6 clusters