Problem 14 0/1 point (graded) Bottom-up linkage" methods for hierarchical clustering work by (i) initially putting each data point in its own cluster and then (ii) successively merging two existing clusters. How many merge steps are needed when there are n data points? Your answer should be a function of n. [Your answer will not be correctly parsed if you include spaces in it.] ? Hint (1 of 1): Try a couple of small examples, with 3-10 data points. Next Hint Submit Hint