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

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

50.What type of chart is best used to show the hierarchical structure of data?  A. Pie chart  B. Bar chart  C. Histogram  D. Tree map

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

Discrete data is typically represented using which type of chart or graph?*2 pointsA. Line chartB. Bar chartC. Scatter plotD. Histogram

What is a key characteristic of hierarchical clustering?Answer areaIt requires the number of clusters to be specified in advanceIt can be visualized using a dendrogramIt is a partitional clustering methodIt is always faster than K-Means