5.3 [5 pts.] ) Given three clusters, A, B and C, containing a total of six points, where each point is defined by an integer value in one dimension: A={0,20,60}B={30,90}C={110} Which two clusters will be merged at the next iteration when using Euclidean distance and single linkage (min) algorithm? a) ] Merge A and B. b) Merge B and C. c) Merge A and C