1. The K in the K-Means algorithm specifies which of the following: a. The number of partitionuclusters) that we want to get out of a given dataset. b. This is the maximum number of itentions that the algorithm runs for. c. This is the number of data-poims that the simitarity metric considen at each iteration. d. The average distance between clester centroids over all algorithm iterations. 2. Suppote a clucer contain the points (A=(1,3),B=(3,3),C=(2,1)). What is the centroid of the cluster? a. (2,233) b. (233,2) c. (2,3) d. None 3. In the figure below, if you draw a horizontal line on y-axis for y=2. What will be the number of clusters formed? a. 5 b. 6 c. 2 d. 3 4. formed by a clustering procedure where all points start out in one large cluster, then clusters are a. Nod by dividing this cluster into smaller and smaller clusters. a. Non-hierarchical clustering b. Divisive clivering d. KB ge a. A tree diagram used to illustrate the arrangement of clusters in hierarchical clustering. 5. What is a Dendrogram? b. A type of hierurchical clustering. c. A type of bar chart diagram to visualize k-means clusters. d. A tree diagram used to illustrate the arrangement of clusters in partitional clustering. 6. Which of the following statement about DBSCAN algorithm is false? a. Can find arbitrarily shaped clusters b. No need to specify number of clusters c. Robust to outliers d. Not sensitive to parameters