Let's now consider the $k-$means algorithm where $k=2.$ If the initial prototypes are in the locations $x_A=5$ and $x_B=21($cluster $C_1)$ and

$x_A=5$ and $x_B=-14($cluster $C_2),$ where will the prototypes be after the first update? Round the numerical values to one decimal.

Final location of cluster $C_1$ centre: $x_A=$

and $x_B=$

Final location of cluster $C_2$ centre: $x_A=$

and $x_B=$