It's a computer system course. Just explain the answer and If u were asked to do this, how would you approach the answer Just explain each function.

int byteSwap(int x, int n, int m) //In a & b we get the entire byte by shifting left by 3 (visualise it) //He shift 0xFF by a and OR t with 0xFF shifter by b and get the complement //Then we shift everything again by a, and & with 0xFF to get our new bytes //Then we return the given bytes swapped int a- n> a ) & 0xff; int secondbyte- (x>> b) & 0xFF return (x & flip) I ((secondbyte > Max ops: 20 Rating: 3 int addoK(int x, int y) t //we XOR the sign of x and y, returns 1 if same //Compare sign of x with the sum of x and y //bang bang return, not sure why but works return ((((x>>31) (y31))) & (((xy)31) (x>31))) * conditional same as x y z conditional(2,4,5) Legal ops: -& A+> Example: 4 Max ops: 16 Rating: 3