Let us consider a one-dimensional space. We wish to perform a hierarchical clustering of the points 1, 4, 9, 16, and 25. Show what happens at each step until there are two clusters and give these two clusters. Your answer should be a table with a row for each step; the row should contain the members of the new cluster formed, and its centroid. More specifically, if you are merging a cluster C1 = {x,y,z} of centroid c1 with a cluster C2 = {p,q} of centroid c2, please use a centroid-centroid distance |c2-c1| to measure the distance between C1 and C2, and you should report {x, y, z, p, q} in the table, as well as the centroid obtained with these