(4,10) (7,10) (4,8) (6,8) (12,6) (10,5) (114) (3,4) (9,3) (12.3) (2,2) (5.2) Figure 3: An example point set for Problem 5 and 6 Problem 5 (5 points) (Exercise 7.2.3 MMDS Book): Construct the cluster tree of the example point set in Figure 3 if we choose to merge the two clusters whose resulting cluster has the smallest radius. The radius of a cluster X is Rad(X) max d(c, ) where c is the centroid of X. That is, c