general alg to determine the chinese remainder theorem. Do the pseudcode for that

Example: X = 2 mod 3 M2=5* 7 = 35 2y1 = 1 mod 3 y1 = 2 X = 3 mod 5 M2 = 3 * 7 = 21 1y2 = 1 mod 5 y2 = 6 X = 2 mod 7 M3 = 3* 5 = 15 1y3 = 1 mod 7 y3 = 8 m=3*5* 7 = 105 for y135 mod 3 = 2 x=(2* 35 * 2) + (3 * 21* 6) + (2* 15 *8) = 758 Y2 21 mod 5 = 1 -105 Y3 15 mod 7 = 1 653