(a) Write and explain the Agglomerative hierarchical algorithm. Differentiate the Agglomerative and Divisive clustering with suitable examples. (b) Explain K-dimensional tree with insertion rule. Insert the following points into an initially empty 2-1) tree. (c) (3, 6). (17, 15), (13, 15), (6, 12), (9, 1), (2, 7), (10, 19). Write and explain the Silhouettes algorithm with suitable examples and diagrams. What is Locality Sensitive Hashing?