Apply k-means clustering on the following data in a 2-dimensional Euclidean space. Assume k = 2 (k is the number of clusters). You can stop after two rounds. Assume the initial centroids are points a = (4, 8) and b = (2, 8).

Provide all intermediate computations.

Note: You must use Manhattan Distance for this problem.

point a: (4, 8)

point b: (2, 8)

point c: (1, 1)

point d: (0, 0)