For the following sets of two-dimensional points, (1) provide a sketch of how they would be split into clusters by k-means for the given number of clusters and (2) indicate approximately where the resulting centroids would be. assume that we are using the squared error objective function. (a) k = 2. assuming that the points are uniformly distributed in the circle, how many possible ways are there (in theory) to partition the points into two clusters? what can you say about the positions of the two centroids? (b) k = 3. the distance between the edges of the circles is slightly greater than the radii of the circles. (c) k = 3. the distance between the edges of the circles is much less than the radii of the circles