This question is asked on Wolfram Mathematica Software , how can i write this using Module[] command ?

Goldbach's Conjecture states that every even integer greater than 2 can be written as the sum of two primes. For example, 10 = 7 + 3 and 100 = 97 3. It is not known if this conjecture is true, but it has been verified up to at least n = 1018. Write a function called goldbach[n] that takes as input an integern and either produces a list Ip,q^ where p and q are positive primes, n -p+q, and p is as small as possible, or prints the message "No decomposition exists" if n cannot be written in the formp+q(this should only happen when n is odd, though odd numbers of the form 2+ q still have this kind of decomposition). Goldbach's Conjecture states that every even integer greater than 2 can be written as the sum of two primes. For example, 10 = 7 + 3 and 100 = 97 3. It is not known if this conjecture is true, but it has been verified up to at least n = 1018. Write a function called goldbach[n] that takes as input an integern and either produces a list Ip,q^ where p and q are positive primes, n -p+q, and p is as small as possible, or prints the message "No decomposition exists" if n cannot be written in the formp+q(this should only happen when n is odd, though odd numbers of the form 2+ q still have this kind of decomposition)