In a clustering problem, the input data set contains three data points: (3,3), (5,4), (10,9). The Manhattan distance is chosen to compute the distance between two data points. The initial centroids are (3,3) and (5,4). Describe detailed steps of finding two clusters of the three data points using the k-means method (k=2). In each step, report cluster assignments of data points and new centroids.