Consider the K-Mean clustering algorithm. Eight samples are given below. Assume that there are three clusters, i. e. K =3. Initial partitions S1(0), S2(0), S3(0) are also given below. Suppose Euclidian distance is used. First sketch the samples and the initial partitions. Then continue with the k-mean algorithm by finding the centroids. Do more iterations of finding both the partitions and the centroids until convergence. Provide your results by showing both the partitions and the centroids. x1 x2 x3 x4 x5 x6 x7 x8(0,1) (0,-1) (0,3) (0,4) (1,3) (3,0) (3,1) (4,0) S1(0) = {x1, x2, x3}S2(0) = {x4, x5, x6}S3(0) = {x7, x8}