5.3) [5 points, -2 for wrong answer] Which of the following methods will cluster the data in panel (a) of the figure below into the two clusters (red circle and blue horizontal line) shown in panel (b)? Every dot in the circle and the line is a data point. In all the options that involve hierarchical clustering the algorithm is run until we obtain two clusters. Choose ALL correct choices: there may be more than one correct choice, but there is always at least one correct choice. No explanation is required. (a) Unclustered (b) Desired clustering a) Hierarchical agglomerative clustering with Euclidean distance and complete linkage (MAX) b) Hierarchical agglomerative clustering with Euclidean distance and single linkage (MIN) c) Hierarchical agglomerative clustering with Euclidean distance and controid linkage d) k-means clustering with k = 2