mise([feedbackDiv]);
            });
        });

        function getCorrectFeedback(index) {
            switch (index) {
                case 0:
                    return "Formally, we define a clustering as a partition. A partition of \\([n] = {1,\\ldots,n}\\) of size \\(k\\) is a collection of non-empty subsets \\(C_1,\\ldots,C_k \\subseteq [n]\\) that: are pairwise disjoint, i.e., \\(C_i \\cap C_j = \\emptyset\\), \\(\\forall i \\neq j\\); cover all of \\([n]\\), i.e., \\(\\cup_{i=1}^k C_i = [n]\\). 