binary dump

The basic idea is to create a function that will do a binary dump of an integer. The exact nature of the output is not specified so you can place the digits consecutively, or with space separators. In addition to doing the dump, you must write two methods for finding the value of the i'th bit of an integer. Here are the methods you need, but you can vary the names: int findBit(int i,index j) /* this method outputs the value of the j'th bit of integer value i, where j is between 0 and 31, and where the zero bit is the rightmost bit (least significant); the function can optionally return a boolean value; you must use shifts to implement this function */ int findBit2(int i,index j) /* same as findBit, but you must use a mask to find the bit, and one of the bit operations &, |, ^ */ void bdump(int i) /* binary dump of integer i ; use one of the methods above to do the dump */ You can place hard coded tests in your main method, or obtain data interactively. Randomly generated integers do not lend themselves to easy human verification that your dump is correct. So your tests should include values that are easily checked. For example an integer initialized with a hex specified constant is easy to check. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.