Multiplication of Prime numbers

Question

Create a program which can list out all the pairs of Prime numbers within a range that when multiplied gives a number whose summation of digits results in one of the parent prime number.

Suppose 3*7 = 21(2+1 =3), so 3 - TRUE - matches one of the number
13*3 = 39 (3+9 = 12; 1+2 =3) - TRUE - program first check if number 12 is present and if not then it adds 1+2 and checks if this matches.
7*11 = 77 (7+7 = 14; 1+4 = 5) - FALSE - Both ways none of the numbers match

Target is to List out all such pairs within range 100. You can use any programming Language.

Answer 1

https://code.sololearn.com/c0FPMrF3Stq5/?ref=app

Answer 2

My try. Kindly Review.
https://code.sololearn.com/cH6DU6r6QqBZ/?ref=app

Answer 3

So we have to list all binary pairs (a,b) which satisfy the above condition? And print all such pairs in which a && b are < 100?