Traditionally, the vanilla versions of clustering algorithms are not capable of ensuring fairness because they assign the data points to the closest center without the fairness consideration. Hence, if we could divide the original data set into subsets such that each of them satisfies the balance threshold \(t\) 
then grouping these subsets to generate the final clustering would still preserve the fairness constraint. Each fair subset
is defined as a fairlet.
We follow the definition of fairlet decomposition by [1]}.
 (Fairlet decomposition)
