Consider the following data points: - A:(15,1) - B:(L,1) - C:(3,3) - D:(3.4) - E:(4.35) - F:(5,6) (a) Calculate the Manhattan Distance between all data points and fill in the following distance matrix. (6 marks) m m 9O O W > (b) Perform Hierarchical Clustering using Manhattan Distance and Average Linkage, show your steps and calculations. (8 marks) (c) Draw the resulting dendogram. (3 marks) (d) Determine the optimal number of clusters, justify your answer. With this optimal number of clusters, what are the members in each cluster?