Mario has received 16 unlabeled thumb-drives with ads on them. he has 8 gray drives which have the print ad, 4 pink drives which have the digital display ad, and 4 blue drives with the video ad. what is the minimum number of thumb-drives he must open to ensure that he has one of each color with each ad? *

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