1. Consider the following description of a clustering strategy/algorithm: The algorithm proceeds iteratively. Starting out at the bottom of the dendrogram, each of the n observations is treated as its own cluster. The two clusters that are most similar to each other are then fused so that there now are n-1 clusters. Next the two clusters that are most similar to each other are fused again, so that there now are n-2 clusters. The algorithm proceeds in this fashion until all of the observations belong to one single cluster, and the dendrogram is complete. a) What is the name of this clustering strategy/algorithm? 2. In k-means clustering name and BRIEFLY describe two strategies for selecting the number of clusters. 1. Consider the following description of a clustering strategy/algorithm: The algorithm proceeds iteratively. Starting out at the bottom of the dendrogram, each of the n observations is treated as its own cluster. The two clusters that are most similar to each other are then fused so that there now are n-1 clusters. Next the two clusters that are most similar to each other are fused again, so that there now are n-2 clusters. The algorithm proceeds in this fashion until all of the observations belong to one single cluster, and the dendrogram is complete. a) What is the name of this clustering strategy/algorithm? 2. In k-means clustering name and BRIEFLY describe two strategies for selecting the number of clusters