Write a method that performs a bit-wise logic-shift-right, then a bit-wise logic-shift-left on the binary representation of the non-negative integer input parameter. Return the integer representing the resulting binary number. For example, if the input parameter is 23, the binary representation for that is 10111. After logic-shifting-right, you would have 1011. Next you would logic-shift-left resulting in 10110. The decimal number for 10110 is 22, so you would return a 22. The right-most digit will always be a zero after performing the logic-shift left. Look at the test data for additional examples. You may assume that the input parameter is small enough not to produce an integer "overflow". You may NOT use ANY strings or string methods.