Problem 1 (20 points). The kmeans algorithm, which we discussed in the class, is being run on a small two-dimensional dataset. After a certain number of iterations, you have two clusters as shown below:' 11) X y Cluster 1 3 4 Cluster 1 2 5 3 Cluster 1 3 6 4 Cluster 1 4 4 5 Cluster 2 5 4 7 Cluster 2 6 7 6 Cluster 2 7 8 4 Cluster 2 Run one more iteration of the kMeans clustering algorithm and show the two clusters at the end of the iteration. Use Manhattan distance when calculating the distance between objects