Question $2.$ Clust

Consider the following $7$ two$-$dimensional observations:

Observation $i$

Plot the observations in a two$-$dimensional graph.

Perform $K-$means clustering with $K=2$ using the Euclidean norm. Toss a coin $7$

times to initialize the algorithm.

Cluster the data using hierarchical clustering with complete linkage and the Euclidean

norm. Draw the resulting dendrogram.