The fuction hasAOne must return a 1 if the number has a 1 somewhere in the binary representation of the number.

int hasAOne(int num) {

return ___;

}

Using only bitwise and boolean operators (no if-then tests, comparisons (e.g., ==, !=, >, <, >=, <=), arithmetic operators (e.g., *, +, -, /, %) or for/while loops), complete the fuction.

For an example, this is a function that checks if the binary number has a zero:

int hasAZero(int num) {

return !!~num;

}