C++ Programming Problem: You are given n sets S1, S2,..., Sn - For each i, you want to choose x; E Si, such that the variance of the multiset {x1, x2, ... , Xn} is minimized. The variance of a...

Extracted text: C++ Programming Problem: You are given n sets S1, S2,..., Sn - For each i, you want to choose x; E Si, such that the variance of the multiset {x1, x2, ... , Xn} is minimized. The variance of a multiset {x1, x2, ..., xn} is defined as o2 where u is the mean, which equals n n Say the minimum possible variance is R. Print n² × R. It can be proved that n²R is always an integer. Input: 3371 25 11 Output: 4