Cluster the following documents using K$-$means with K$=2.$

D$1$: $$information retrieval information$$

D$2$: $$information mining$$

D$3$: $$mining retrieval$$

D$4$: $$retrieval retrieval$$

Assume D$1$ and D$3$ are chosen as initial seeds. Use tf without idf and Euclidean distance for computation. Show the clusters and their centroids, after each iteration until convergence. $[$Show the intermediate steps clearly$].$