$1)$ For the function int$2$bitstr in which I is the input and both str and XOR$\_$Result are the outputs, you need to do two things. a$)$ You need to store the bit pattern of the $32-$bit integer I in str as a $32-$length string of $0$s and $1$s $($remember that strings are null$-$terminated so you should put a null character like str$[32]=\text{'}\backslash 0\text{'}).$ The first character in the string will be the most significant bit from I, and the last non$-$NULL character will be the least significant. You must use bit$-$level operations to determine whether a character should be a zero or one. The only allowed integer arithmetic is increment $(++)$ or decrement $(--)$ in the loop. b$)$ You need to return the exclusive OR $($XOR$)$ result between the least significant byte $($LSB$)$ and the second least significant byte $($second LSB$)$ of I. To do so$,$ you can only use bitwise operators such as right shift $(>>),$ AND $($&$),$ and XOR $(^).$