We apply the k-means clustering algorithm with k = 2 to the following data points: [(0,5), (0, 2); (0, -1); (5.3); (5,-2): (7,0)). The initial centroids are c, = (4.4) and C = (0,5). At the first iteration, to which centroid are assigned the points! (0,5) (0,2) 1 (0, -1) (5, 3) (5,-2) | (7,0) After convergence, to which centroid are assigned the points? (0,5) (0,2) 0,-1) (5,3) . The following figure shows a plot of our training examples. The data vectors have two dimension (X, and X2) and the classes of the goal attribute are squares, circles or triangles. Given the two new unclassified inputs (stars), what would be the result of applying k-nearest neighbors (KNN) with k = 3 and k = 7? Xi Classification: Input 1. k=3 k=7 A A A A A Input Input 2. k=3 k = 7