Given the following eight points point 1 point 2 point 3 point 4 point 5 point 6 point 7 point 8 (4,1) (7,6) (6,2) (2,4) (5,3) (1,7) (8,5) (3,8) cluster them using the k-means algorithm (all distances are Euclidean) until convergence, i.e. until there is no change in clusters. Assume the parameter k = 3 and the initial cluster centroids are point 1, point 2, and point 3. What is the resulting clustering? O a. {1, 2, 4), (5, 6, 8}, {3,7} O b. {1, 4), (6, 8), (2, 3, 5, 7} O c. none of the proposed answers O d. {4}, {1, 6, 8}, {2, 3, 5, 7} O e. {1}, {4, 6}, {2, 3, 5, 7, 8) O f. {1, 4, 6), (3, 8), (2, 5, 7)

need help with this computer scinece problem

Mark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.

Show all calculation.