3. dbscan algorithm consider the following eight point in a 2-dimensional space: {(2, 10); (2, 5); (8, 4); (5, 8); (7, 5); (6, 4); (1, 2); (4, 9)}. suppose we use the euclidean distance metric. if epsilon is 2 and min_samples is 2, what are the clusters that dbscan would discover. plot the discovered clusters. what if epsilon is increased to √10 ?

company a

step-by-step explanation:

using the linear regression models , it is found that company a   pays about $14 more. but using the same regression (linear) company b pays about $10 more.

so company a pays more than b

range =5

step-by-step explanation:

to find the range, we take the largest value and subtract the smallest value.

the largest value is 5

the smallest value is 0

the range is 5-0   =5

hi there, i would be interested to you with your test, may you add the questions and answer options.

- : )