I need help to do this code example. It's in the python programming language.

. Write a Python program called crt.py 3. Chinese Reminder Theorem that finds the value of x that satisfies a system of congruencies of the form: x=b(mod s) xc (mod where a, b, and c are integers; and r, s, and t are pairwise relatively prime positive integers (i.e., gcd (r, s)gcd(s, t)-gcd (r, t)). Your program prompts the user for the values of a, b, c, r, s, and t, and outputs the value of x that satisfies the system of congruencies. Hint: see the NumPy Ntheory class reference: http://docs.sympy.org/dev/modulestheory.html