Use the same dataset used in Question $1($Given in K$-$means pictures$)$ for the following problem. The Eurlidean Distance: matrix betwem each pair of the data points is listad in the figure below:

$($a$)(8$ points$)$ Petform single and completo link higrarchical clustering. Show your rusilts by drawing corresponding dendrogram. The dendrogram should clearly shous the order and the helght in which the chusters are merged. In case of a tie please resolve in alphabetical order of the points labels. NO PAPTIAL CREDIT.

$($b$)($I points$)$ Using Stim of Squared Error $($SSE$)$ and assuming there are three clusteas. which of the single the and rompleto link hierarchical clustering will yield better results? Justify your answer.

$($c$)(3$ points$)$ Compare the clustars from $2($b$)$ with the clustors found using K$-$means in Quation $1$ by calculating their correqunding Sum of Squared Eirors $($SSE$)$s$,$ Aceording to fheir SSE results, which is bettern K$-$means or hierarchicsal chstering?

Figure $3$: Euclidean Digtahce Matrix

Figure $1$: K$-$means Clustering $($a$)$

$($n$)/($x$)$

$$

$($n$)/($x$)$

$

Figure $2$: K$-$means Clustering $($b$)$