Explain about K$-$Means Clustering? Differentiate Hierarchical Clustering

Algorithms with Partitioning Algorithms along with their working procedure?

B$)$ Consider below sample data and apply K$-$Means clustering. Take subjects $1$ and $4$ as

initial cluster centers and then identify the cluster centers after two iterations. Note:

Choose the Manhattan distance as distance measure.

Subject A B

$11\mathrm{.}01\mathrm{.}0$

$21\mathrm{.}52\mathrm{.}0$

$33\mathrm{.}04\mathrm{.}0$

$45\mathrm{.}07\mathrm{.}0$

$53\mathrm{.}55\mathrm{.}0$

$64\mathrm{.}55\mathrm{.}0$

$73\mathrm{.}54\mathrm{.}5$