Part $3.$ Glustering Users $(18$ marks$)3\mathrm{.}1$ Apply KMeans clustering using the Euclidean distance matrix. Use $5$ as a k and do the clustering $[10$ points$]$

Some Notes:

What is K$-$Means Clustering? Watch here

Learn more about K$-$Means and otehr clustering techniques from RealPython

Save the $k-$means model as kmeans$\_$model$\_$euclidean

$[]$ # A $3\mathrm{.}1$

# YOUR CODE HERE

raise NotImplementedError$()$

Lets now quickly do a scatter plot of $2$ variables and then use the cluster labels as colors

$[]$ assert kmeans$\_$model$\_$euclidean,n$\_$clusters $==5$