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 for me.

int replaceByte(int x, int n, int c) { //Store whole byte n in a by shifting by 3 //Mask of 1's that shifts by a byte //Shift bytes and replace with the byte c that you wanted to add //by using mask and OR int a= n > 1) & 0x55555555u) | ( (x & 0x55555555u) 2) & 0x33333333u) | ((x & 0x33333333u) > 16) & 0xffffu) | ((x & 0xffffu) > *Max ops: 30 Rating: 4 int satAdd(int x, int y) //Sum the two values //Check for overflow by XORing sum with x & comparing with XOR'd sum of y then getting the sign of integer //if negative, sum shifts right by 31 and gives smallest possible value //if postive, shifts to left by 31 and gives largest possible values int sum x+y; int overflo (sum*x)&(sumy))>>31; return (sum>>(overflo & 31)) (overflo