3. (25) (Written) Consider the following data points on X-Y plane and implement the complete linkage hierarchical clustering over the following data points. data points = {(1, 1), (2, 1), (4, 1), (2, 6), (3,3), (4,4), (5,3) } Complete linkage distance from cluster A and B can be calculated using the below formula: d(A, B) = max 8(x,x') XEA,XEB where o(x, x') should be taken as Manhattan distance (e.g., S((1,2), (3, 1)) = [1 -3| + (2-1|= 3). (Note: Show your calculation at each iteration to get the full credit. ) 1. (10 pts) Implement the complete linkage hierarchical clustering over above data points. (Show the steps!) 2. (5 pts) Draw the dendrogram after obtaining the clusters from complete linkage based hierarchical clustering. 3. (5 pts) Can hierarchical clustering help in detecting outliers? Why /How? 4. (5 pts) In general, can we prune the dendrogram? How