QUESTION 2: (25 Marks) Given an input Euclidean distance matrix of size 6 by 6, as shown in Table 1. 1 2 3 4 5 6 1 0 2 0.12 0 3 0.51 0.25 0 4 0.84 0.16 0.14 0. on 0.28 0.77 0.70 0.45 0 CO 0.34 0.61 0.93 0.20 0.67 0 Table 1: Euclidean Distance Matrix i. Perform single linkage-hierarchical clustering (agglomerative) and draw the dendrogram (10 Marks) ii. Perform complete linkage-hierarchical clustering (agglomerative) and draw the dendrogram. (10 Marks) How to determine the optimal number of clusters from the dendrogram? Show in your dendrograms. (4 Marks) If you are using K-mean clustering, how to determine the optimal number of clusters? (1 Marks) iv