Suppose that the following data points with single features are given. Data ID Feature 1 0.0 2 1.0 3 3.0 4 5.5 5 8.3 Exercise 1 You are required to report, given the above data points, how and what dendro- gram (tree diagram) the agglomerative hierarchical clustering algorithm builds for each of single and complete linkages. You also could confirm that the den- drogram built with complete linkage is shallower than that built with simple linkage. Exercise 2 You are required to report how Lloyd's algorithm (K-means) works for the data points given above and what cluster set it produces if K = 2 and initial centroids are 0.0 (the data #1) and 1.0 (the data #2)