10. [10 marks] Apply hierarchical clustering on the following data in a 2-diemnsional Euclidean space. Assuming stopping point is k = 2 (k is the number of clusters). Provide all intermediate computations. Note: use Manhattan Distance. Dist( (x1, x2), (y1, y2)) = (x1 - yl + 1x2 - y2| For example, Dist( (4,10), (3, 8)) = 14-31 + |10 - 8) = 1 + 2 = 3 a) (4, 10) b) (3, 8) c) (6, 10) d) (6,8)