Consider the following data set, S and four dendrograms. Dataset, S 1 1 2 E2 2 1 T3 1 3 4 5 4 5 6 3 6 7 2 6 1 x7 4.00 4.00 1.41 1.00 1.41 1.00 . Is Is It . 4 35 X6 E7 HT1 HT2 4.80 6.00 4.24 2.29 1.62 1.41 1.00 1.41 1.00 x x x x4 15 16 17 Is I, I4 T5 T6 x7 HT3 HT4 For questions Q 11 and Q 20, Suppose that a certain clustering algorithm clustered the dataset S into following three clusters: C1 = {21.22.&3}, C2 = {x4, X5}, C3 = {26.27}} Q 11. Find graph-based view of cohesion: cohesion(C1) = ? (a) 1.93 (b) 2.68 (c) 4.65 (d) 5.19 Q 12. Find graph-based view of separation: separation(C1,C2) = ? (a) 4.43 (b) 5.19 (c) 27.40 (d) 31.67 Q 13. Find graph-based view of separation: separation(C1, C3) = ? (a) 4.43 (b) 5.19 (c) 27.40 (d) 31.67 Consider the following data set, S and four dendrograms. Dataset, S 1 1 2 E2 2 1 T3 1 3 4 5 4 5 6 3 6 7 2 6 1 x7 4.00 4.00 1.41 1.00 1.41 1.00 . Is Is It . 4 35 X6 E7 HT1 HT2 4.80 6.00 4.24 2.29 1.62 1.41 1.00 1.41 1.00 x x x x4 15 16 17 Is I, I4 T5 T6 x7 HT3 HT4 For questions Q 11 and Q 20, Suppose that a certain clustering algorithm clustered the dataset S into following three clusters: C1 = {21.22.&3}, C2 = {x4, X5}, C3 = {26.27}} Q 11. Find graph-based view of cohesion: cohesion(C1) = ? (a) 1.93 (b) 2.68 (c) 4.65 (d) 5.19 Q 12. Find graph-based view of separation: separation(C1,C2) = ? (a) 4.43 (b) 5.19 (c) 27.40 (d) 31.67 Q 13. Find graph-based view of separation: separation(C1, C3) = ? (a) 4.43 (b) 5.19 (c) 27.40 (d) 31.67