Consider five points $\{$X$1,$ X$2,$ X$3,$ X$4,$ X$5\}$ with the following co

ordinates as a two dimensional sample for clustering : X$1=(0\mathrm{.}5,$

$2\mathrm{.}5)$; X$2=(0,0)$; X$3=(1\mathrm{.}5,1)$; X$4=(5,1)$; X$5=(6,2)$ Illustrate

the K$-$means partitioning algorithms using the above data set.