Data item A B D E IF G . Descriptor-1 1 5 8 12 16 19 21 24 a. Use the bisecting k-Mean cluster algorithm to cluster these data into 3 clusters. Apply the basic k- mean algorithm within the bisecting k-mean for one iteration to split a cluster into two clusters. Assume that the initial two clusters centers are at: (11) and (22) and the condition for choosing the next cluster to be split is the one with the largest number of items. {Note: when you choose a cluster to bisect choose the two centers randomly} b. Validate the clusters generated in problem (4) using the graph based cohesion and separation measures c. Validate the clusters generated in problem (4) using the prototype based cohesion and separation measures