Use RARS code

Your coding assignment for this week will be to take an integer as input, swap two bits of its binary representation at indices also provided as input, then print off the smaller of the two numbers followed by the larger. If they are equal in size, print "The two numbers are identical." and exit. For the indices provided to swap, we will assume little-endian bit indexing, where the least significant digit is index 0 and the most significant digit is index 31 (e.g. In the binary number 1000 , the 1 is at index 3). You may assume that the user will always input an integer within the range of a 32-bit signed number, and indices between 0 and 31 . The inputs will all be in base 10. Other than those assumptions, make sure that your test cases cover all edge cases that you can think of. Be sure to comment your code thoroughly. In RISC-V, there is no such thing as over-commenting