On the other hand, if our original number is not a power of 2, we will not obtain O when we follow the same steps. For example, if we look at 010000012 = 6510, the result of subtracting 1 from the binary representation will not be a string of 1's, and as a result, we Wy not obtain 0 when we evaluate the bitwise & between this and the original numbdr, as shown below: 01000001 1 = 01000000 01000000 & 01000001 = 01000000 This means that a robust test for determining whether an integer is a power of 2 would be to first subtract 1 from it, then evaluate the bitwise & operator between the result and the original number. If the end result is equal to 0, it means our original number is indeed a power of 2. Otherwise, the original number is not a power of 2. Exercise 1 Write a C program named "lab2.c" that implements a function named is_power2() that accepts an Integer as an input argument and returns true if the input argument is a power of two. This function must return false if the input argument is not a power of 2. Requirements Your "lab2.c" program must meet the following requirements for full credit: 1. You must submit only a single file named "lab2.c". 2. Your is power2() function must use a single return statement 3. You must include the following main() function in your "lab2.c" program die de stoc in mano spower(1024) printre printre nor "); is power2(1026) printf("SIN"printf(NOT