Consider a data set consisting of 6 observations: (1,1),(1,3),(2,4),(4,3),(5,1),(6,2). (a) Perform K-means clustering with K=2. Use Manhattan distance and the following initial assignment: Cluster 1:(2,4),(4,3),(5,1) Cluster 2: (1,1),(1,3),(6,2). Show all iterations in full detail. (9) (b) Perform hierarchical clustering. Draw a dendrogram with Manhattan distance and average linkage. Cut the dendrogram to obtain two clusters