Consider the following toy 1-D dataset: (5, 0, -1, 6, -2, 4). Apply and calculate cluster means and memberships for a k-means clustering algorithm on this dataset with k-2. Show your results for each iteration until the algorithm converges. Assume the initial cluster memberships C1: (5, 0, -2) and C2: (-1, 6, 4). Note: this is a paper and pencil problem. Do not write and execute code for it.

Consider the following toy 1-D dataset: (5, 0, -1, 6, -2, 4). Apply and calculate cluster means and memberships for a k-means clustering algorithm on this dataset with k-2. Show your results for each iteration until the algorithm converges. Assume the initial cluster memberships C1: (5, 0, -2) and C2: (-1, 6, 4). Note: this is a paper and pencil problem. Do not write and execute code for it.