i) The example below shows the K-means algorithim (assuming K=2 ) at the first iteration where cluster assignments are made for the 7 instances (i.e., data points) listed using Euclidean distance. You are asked to recalulate the centroids for iteration 2 and expand this example for one further iteration (i.e., there is no need to go to iteration 3). Note: Your example should clearly show the membership of the resulting clusters and their new centroids