In cryptarithmetic puzzles, mathematical cquations are written using letters. Each letter can be a digit from 0 to 9 , but no two letters can be the same. Customarily, distinct letters stand for different digits Here is a sample problem: SEND + MORE = MDNEY A solution to the puzzle is S=9,R=8,0=0,M=1,Y=2,E=5,N=6,D=7 S E N M ORE + M 0NEY That is, 9567 1085 +10652 Write at program that finds solutions to the following cryptarithmetic puzzle: TOO+TOO+TOO+TOO=GOOD T00 T00 T 00 T 00 + += G 000 The simplest tochnique is to use a nested loop for each unique letter (in this case T, O, G, D). The loops would systematically assign the digits from 09 to each letier. For example, it might first try T=0,O=0,G=0,D=0, then T=0,O=0,G=0,D=1, then T=0, O=0,G=0,D=2, etc, up to T=9,O=9,G=9,D=9. In the loop body test that each variable is unique and that the equation is satisfiesl. Output the valus for the letters that satisfy the equation. Expected Output: The values are: T=10=6G=0D=4 The values are: T=40=9G=1D=6