Part (a) was already answered, need part (b)

11. Read and understand Section 4.7 of the Kleinberg/Tardos textbook. G = (V, E) is a complete and undirected graph with 8 vertices (i.e. G is KS). A subset of the edges of G are listed below and sorted in order of increasing weight. Any edge that is not listed below has a weight that is greater than 8. The meaning of the vertices and edges in G could have any meaning you see fit, but you could imagine that each v EV represents an essay submitted by a student, and each cost(e), where e = {u, v} E E, represents some dissimilarity measure between the essays represented by u and v, where more dissimilarity between u and v means a higher cost for the edge {u, v}. Answer the following questions. Graph G: Lower Letter | Higher Letter | Weight CON OCT CT (a) Find the 2-clustering (i.e. k-clustering with k = 2 clusters) of maximum possible spacing, where "spacing" is defined in the section of the book that you are to read. Your answer to this problem must list the contents of (i.e. the vertices and edges within) each cluster. (Normally, once the clusters have been finalized, one may not care about the distances between the members of a given cluster, but I ask for them here since you need to find them anyways.) (b) Find the 3-clustering of maximum possible spacing of G. 11. Read and understand Section 4.7 of the Kleinberg/Tardos textbook. G = (V, E) is a complete and undirected graph with 8 vertices (i.e. G is KS). A subset of the edges of G are listed below and sorted in order of increasing weight. Any edge that is not listed below has a weight that is greater than 8. The meaning of the vertices and edges in G could have any meaning you see fit, but you could imagine that each v EV represents an essay submitted by a student, and each cost(e), where e = {u, v} E E, represents some dissimilarity measure between the essays represented by u and v, where more dissimilarity between u and v means a higher cost for the edge {u, v}. Answer the following questions. Graph G: Lower Letter | Higher Letter | Weight CON OCT CT (a) Find the 2-clustering (i.e. k-clustering with k = 2 clusters) of maximum possible spacing, where "spacing" is defined in the section of the book that you are to read. Your answer to this problem must list the contents of (i.e. the vertices and edges within) each cluster. (Normally, once the clusters have been finalized, one may not care about the distances between the members of a given cluster, but I ask for them here since you need to find them anyways.) (b) Find the 3-clustering of maximum possible spacing of G