The MAX (complete) linkage policy states thet the distence betiveen two custers X and Y can be computed as dist(X,Y)=maxxX,yydist(x,y) where dist (x,y) is a distance that can be computed for any pair of points For a clataset of 5 points, the following distance matrix is calcilated: Agglomerative hlerarchical clustering is applled to extract 3 clusters. The. "MAX linkage" (complete linkage) pollcy is used. What are the 3 clusters obtained? (a) Nane of the other answers ts correct. (b) {a,d},(b,),{c} (c) it. is not possible to answer the question with the avallable information. (d) {a},{c],[b,d,e] (e) {b},{d},{a,c,e} (f) \{d },{b,e),(a,c) (g) {a},(D],[c,d,e] (h) {a,b},{c,d},{e}