2897. Apply Operations on Array to Maximize Sum of Squares

You are given a 0-indexed integer array nums and a positive integer k. You can do the following operation on the array any number of times: - Choose any two distinct indices i and j and simultaneously update the values of nums[i] to (nums[i] AND nums[j]) and nums[j] to (nums[i] OR nums[j]). Here, OR denotes the bitwise OR operation, and AND denotes the bitwise AND operation. You have to choose