Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Jse this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution

Suppose that you want to calculate 1434661 · 3785648743 − 100020304 · 54300201. You are told thatthe answer is a positive integer less than 90. Compute the answer mod 10 and mod 9, then combineto get the answer. Show all the necessary work to obtain your answers. Note: This technique hasoften been employed to do calculations with large integers because most of the computations use smallintegers, with only the Chinese Remainder Theorem step requiring large integers. For example, if theanswer is known to be less than 1036, the calculations can be done mod p for each prime less than100. Since the product of the primes less than 100 is approximately 2.3 × 1036, the Chinese RemainderTheorem gives the answer exactly