Given the dataset: (1, 1), (3, 3), (4, 4), (5, 5), (6, 6), (9, 9), (0, 3), (3, 0) and assuming the initial centroids for (K 3 - means clustering) to be C (3, 3), C = (5, 5) and C3 = (6, 6). One iteration of the Expectation Maximization Algorithm for K-means clustering, will update C3 to = =