(a) Describe the steps of an agglomerative clustering algorithm. [5 marks] (b) Suppose that we have five objects, X1, X2, X3, X4 and X5 that can be clustered. The Euclidean distance between all five objects is measured and the distances recorded in a matrix of distances, D, given by D=028492051078507641070397630 where the element in the tth row and jth column gives the distance, dij, between objects i and j. Using the nearest-neighbour approach, create a dendogram for the above data. Show all steps. [15 marks]