Your cousin, who is planning her wedding, is working on the seating chart for the reception. she is trying to decide which 6 people should be seated at the table closest to the head table. she has narrowed her decision down to a list of 10 friends. if the order doesn't matter, in how many ways can she choose 6 friends from the list of 10 to sit at the table closest to the head table?

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) ).