In this question we explore clustering. The dataset that we will use in this question is shown in Figure 2. a) Gonsider the k+means s ligorithm, where k=2. The prototypes of the first and second clusters will be denoted by C1=(xAT,xB1) and C2=(xA2,xB2), respectively. (ii) Consider two clustering arrangements, In the first arrangement Cy=(1,5) and 12 2=(3,2). In the secono one C1=(3,5) and C2=(5,2). According to the notion of clustering quality in k-means, which arrangement is better? (ii) If the initial prototypes are C1=(3,100) and C2=(3,101), what will be the final solution proyided by k-means? How many iterations will it take to reach this solution? (iii) If the initial prototypes are C1=(3,100) and C2=(3,100), where will the prototypes be after the first iteration of k-means