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

Extracted text: C++ Programming Problem: You are given n sets S1, S2, ..., Sn . For each i, you want to choose x; E S;, such that the variance of the multiset {*1, x2,..., en} is minimized. The variance of a multiset {x1, x2, ..., xn} is defined as ri=1 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