Write a function which extracts all bits less than and excluding the bit i from a 32-bit 2's complement integer such that: num is a 32-bit 2's complement integer i is the index bit with a range of (0, 32) For example, if i = 4 you would return the 4-bit number num [30] (i.e. bits {3,2,1,0}). This must be completed in one line without multiplication, addition, subtraction, division or modulus. All right shifts must be signed. Note: Make sure your answer is of the form "return public static int lowerBits (int num, int i) { }