2. Consider the following dataset. (Note: do NOT write any code for this problem. The answers are to be computed by hand and marked on the graph. You can visually guess some of the answers.) Length 120140130170160180 Width 607080403020 a) Mark the data points on the graph below (use '+' to indicate each point).60 Width 4020140160180120 Length 1 b) Let k=2. Let one of the two initial centers be (Length=120, Width=60). Select the second center using the Farthest Distance Heuristic. Indicate the two centers on the graph (circle the centers). c) Recompute the centers after the first iteration of the k- means algorithm. New center 1 New center 2 Indicate the two new centers on the graph (mark new centers with squares). d) What are the two clusters after this first iteration? Draw two ovals, each containing all the points in one cluster in the graph above. e) Will the k-means algorithm terminate after this first iteration or will it continue? Answer in 1-2 sentences. f) If a new point (Length=140, Width=60) is given, to which cluster will it belong?