Consider the following two-dimensional data points: (a) (Total 3pt) Compute the Euclidean distance between every pair of points. Show your results in a 55 distance matrix. (b) (Total 4pt) Apply the single link (MIN) algorithm to cluster the objects. Draw the dendrogram for the clusters assuming the distance measure is Euclidean. Make sure you label the distance axis of the dendrogram carefully. (c) (Total 4pt) Suppose we apply the complete link (MAX) algorithm to cluster the objects. Draw the dendrogram for the clusters assuming the distance measure is Euclidean. Make sure you label the distance axis of the dendrogram carefully