Ten circles are all the same size. Each pair of these circles overlap but no
circle is exactly on top of another circle. What is the greatest possible total number of
intersection points of these ten circles?
(A) 40
(B) 70
(C) 80
(D) 90
(E) 110

Consider the linear model for a two-stage nested design with b nested in a as given below. yijk=\small \mu + \small \taui + \small \betaj(i) + \small \varepsilon(ij)k , for i=1,; j= ; k=1, assumption: \small \varepsilon(ij)k ~ iid n (0, \small \sigma2) ; \small \taui ~ iid n(0, \small \sigmat2 ); \tiny \sum_{j=1}^{b} \small \betaj(i) =0; \small \varepsilon(ij)k and \small \taui are independent. using only the given information, derive the least square estimator of \small \betaj(i) using the appropriate constraints (sum to zero constraints) and derive e(msb(a) ).