Which of the following is the recommended way to initialize u; in k-means? Oa. Pick a random integer i from {1,...,k}. Set μ1 = μ2 = x(i). ... = Uk = x' Ob. Set every element of ui E R" to a random value between -e and e, for some small e. Oc. Pick k distinct random integers i1, ..., ik from {1,...,m} Set u, = x(1), μ2 = 2), ..., μk = x(tk). Od. Pick k distinct random integers i, ... , ir from {1,...,k} x(1), μz = x2), ... , μk = Set uj = x (ik). .., Hk =

Without importing any Lib:

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false

Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.