Which of the following is NOT a step in applying a K$-$Means clustering algorithm?

$$a$)$ Choose K as the number of clusters.

$$b$)$ In each iteration, compute the distance between any pair of clusters.

$$c$)$ In each iteration, update cluster locations to their new centroids.

$$d$)$ In each iteration, assign data records to their closest clusters.