Given the following code snippet for performing hierarchical clustering in Python: from scipy.cluster.hierarchy import linkage, dendrogramimport matplotlib.pyplot as plt X = [[1, 2], [3, 4], [5, 6], [7, 8], [9, 10]]Z = linkage(X, method='single', metric='euclidean')dendrogram(Z)plt.show() Which part of the code specifies the method for determining the distance between clusters?X = [[1, 2], [3, 4], [5, 6], [7, 8], [9, 10]]linkage(X, method='single', metric='euclidean')metric='euclidean'dendrogram(Z)BackSkipNextFinish

In hierarchical clustering, the distance between clusters is typically measured using the ______________ criterion.Select one:a.Cosine similarityb.Manhattan distancec.Linkage criteriond.Euclidean distance

How is the optimal number of clusters determined in hierarchical clustering?*1 pointBy minimizing the between-cluster sum of squaresBy maximizing the within-cluster sum of squaresBy examining the dendrogram and selecting an appropriate cut-off pointBy using the elbow method on the resulting tree structure

In hierarchical clustering, the final clusters are represented using a ______________ diagram.Select one:a.Line graphb.Dendrogramc.Bar chartd.Scatter plot

Which of the following distance metrics is commonly used in hierarchical clustering?Euclidean distanceCosine similarityHamming distanceJaccard index

In hierarchical clustering, which linkage method considers the maximum distance between points in the clusters when merging two clusters?Complete linkageAverage linkageSingle linkageWard linkage