Number of 1 BitsGiven a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). Example 1:Input: n = 11Output: 3Explanation:The input binary string 1011 has a total of three set bits.Example 2:Input: n = 128Output: 1Explanation:The input binary string 10000000 has a total of one set bit.Example 3:Input: n = 2147483..