(4.10) (7.10) (4.8) (6.8) (12.6) (10.5) (11.4) (3.4) (9.3) (12.3) (2.2) (5.2) Fig. 1 Twelve distinct points in a Euclidean space (2.2) (3.4) (5.2) (4.8) (4,10) (6.8) (7,10) (11,4) (12,3) (10.5) (9.3) (12,6) Fig. 2 Tree showing the complete groupings (3 clusters) of points in Fig. 1 i. Compute the representation of the clusters as in the BFR Algorithm. That is, compute N, SUM, and SUMSQ for each of the clusters. Compute the variance and standard deviation of each cluster in each of the two dimensions. ii. (4.10) (7.10) (4.8) (6.8) (12.6) (10.5) (11.4) (3.4) (9.3) (12.3) (2.2) (5.2) Fig. 1 Twelve distinct points in a Euclidean space (2.2) (3.4) (5.2) (4.8) (4,10) (6.8) (7,10) (11,4) (12,3) (10.5) (9.3) (12,6) Fig. 2 Tree showing the complete groupings (3 clusters) of points in Fig. 1 i. Compute the representation of the clusters as in the BFR Algorithm. That is, compute N, SUM, and SUMSQ for each of the clusters. Compute the variance and standard deviation of each cluster in each of the two dimensions