1. Write a well-commented C program that accepts an integer input from the user and counts the number of bits that are set to zero and number of bits that are set to 1 to represent that integer value in binary format. For example, if the sample input is: Enter the number: 128 Sample output should be: Number of bits that are set to zero: 31 Number of bits that are set to one: 1 2. Write a well-commented C program that accepts an integer and nth position where the valid values on n is in between 0 and 31, both inclusive. The program then checks if the bit in the nth position is set or reset to represent the integer. If the bit in nth position is set (nth bit is 1), then it prints out nth bit is set otherwise, it prints out nth bit is not set. For example, if the sample input is: Enter the number: 101 Enter the position: 4 Sample output should be: Bit in the 4th position is not set