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

$x_A=3$ and $x_B=200($cluster $C_2),$ where will the final prototypes be$?$

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

and $x_B=$

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

and $x_B=$