Consider the following data set$$

$$

D$=\{(2,0),(2,1),(1,2),(3,2),(2,3),(3,3),(2,4),(3,4),(4,4),(3,5)\}$

$$

Apply K$-$means clustering with k$=2,$ using Manhattan distance. Start with $(2,0)$ and $(2,1)$ as the initial centroids $($seeds$).$ Show all intermediate clusters, as well as the final clusters.