Consider the points below in a 2-dimensional Euclidean space, and each point is named by its (x, y) coordinates. Initially, each point is in a cluster by itself and is the centroid of that cluster. Draw on the figure the results for the first 5 iterations of running the basic hierarchical clustering on the data, if we define the distance between two clusters as the minimum of the distances between any two points, one from each cluster. (4,10) (7.10) 0 (4,8) (6,8) (12,6) (10,5) 0 (11,4) (3,4) (9,3) (12,3) (2.2) (5,2)