A Logistics company wants to find the best location for its two warehouses. They have the customer location coordinates. Using the K$-$means clustering technique find the centroid of two clusters. Run the K$-$means clustering for two iterations manually. Excel or python outputs will not be evaluated.

The customer locations are given below: $[14$ marks$]$

Customer

Number

Coordinate $1$

X$1$

Coordinate $2$

X$2$

Customer $1$

$1$

$1$

Customer $2$

$2$

$1$

Customer $3$

$3$

$3$

Customer $4$

$5$

$1$

Customer $5$

$6$

$2$

Customer $6$

$5$

$2$

$2.$