Suppose that clusters are sequentially merged in a way that depends on the within cluster sums of squares providing a path of cluster solutions. This is known as

Select one:

a.

k-means clustering.

b.

Lloyd's algorithm.

c.

complete linkage.

d.

single linkage.

e.

Ward's method.