Write a C program that will swap any two nibbles of a long int x (64-bit integer). A nibble is a four-bit aggregation. There are two nibbles in a byte. For this problem the index of the least significant nibble is 0, and the index of the most significant nibble is 15 (so 0 <= m, n <= 15). So, if x = 0x0123456789ABCDEF (a 64-bit integer), and if you swap two nibbles say that are at the 0th and 15th index, x would now be x=0xF123456789ABCDE0. You are not allowed to use division, multiplication, or modulus, relative comparisons (<, >, <=, >=), loops, switches, function calls, macros, conditionals (if or ?:) You are allowed to use all bit level and logic operations, left and right shifts, addition and subtraction, equality and inequality tests, integer constants (<=255), INT_MIN and INT_MAX, and casting between data types. (20 points).