Representing Clusters in the GRGPF Algorithm: Represent the twelve points of the image as a single cluster. Use parameter k = 2 as the number of close and distant points to be included in the representation. Hint: Since the distance is Euclidean, we can get the square of the distance between two points by taking the sum of the squares of the differences along the x- and y-axes. Once you have the single cluster, compute the radius, in the sense used by the GRGPF Algo-rithm (square root of the average square of the distance from the clustroid) for the cluster that is the five points in the lower right of the image above. Note that (11,4) is the clustroid.

Show all calculations and steps as proof.

(4,10) (7,10) (4,8) (6,8) (12,6) (10,5) (3,4) 114) 9.3) (12,3) (2,2) (5,2)