Clustering 1. consider the following eight points in 2-dimensional space: (2,10); (2,5); (8,4); (5,8); (7,5); (6,4); (1,2); (4,9). suppose we plan to use the euclidean distance metric and that we are interested in clustering these points into 3 clusters. plot the data by hand on paper to see what might be appropriate clusters.

i really dont know

step-by-step explanation:

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for