Convert the following C fragment to equivalent MIPS assembly language. Assume that the variables a and b are assigned to registers $t1 and $t2, respectively. Assume j is assigned to $s0. If for condition is not satisfied, go to a label called EXIT. for (int j=0; j <5; j++){
a += b;
}

Hey i really need some solving this problem: 1. encrypt this binary string into cipher text: 110000. include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x n mod (m) = y & 2. decrypt this cipher text into a binary string: 106 you.