Part A: This deals with getting and validating user input, calling the functions, and displaying results. The view controller is responsible for detecting input values of zero and will not call the other modules in that event.

Part B: BitCount receives one parameter, a $32-$bit unsigned integer. It will find the rightmost and leftmost one bits. It will return one value, the distance between the leftmost and rightmost bits inclusive, an integer between zero and $32.$ This function does not just count bits with a value of one, which is a common programming problem.

Part C: This function receives one parameter, a $32-$bit unsigned integer. It returns a value of one $($true$)$ if wraparound is detected, and zero $($false$)$ if not. The function operates by detecting $8-$bit patterns which wrap around the left and right ends of the word. It does this by ANDing the word repetitively with patterns representing the eight possible wraparound patterns. These are $0$x$8000007$F$,0$xC$000003$F$,...$through $0$xFE$000001.$ These patterns are inverted for the actual AND operation, becoming $0$x$7$FFFFF$80,0$x$3$FFFFFC$0,...$ through $0$x$01$FFFFFE. If any AND operation results in a zero result, wraparound is detected.

Part D: This function receives one parameter, a $32-$bit unsigned integer. It returns a value of one $($true$)$ if an invalid pattern is detected, and zero $($false$)$ if not. In the ARM modified immediate context, some otherwise legal values comprising an $8-$bit sequence cannot be created by rotating an $8-$bit constant by an even number of bits. Thus, $255$ is an acceptable value $($binary $0000000011111111),1020$ is an acceptable value $0000001111111100),$ but $510$ is not an acceptable value $($binary $0000000111111110).$