Using the following code, we will be able to find all distinct integers a and b from 1 to n such that GCD[a, b] is prime integer and their number. gcdpr[n_]:=( v=!); statement 1: Do[Do[If[statement2, v=Append[v.statement3]:statement4]. {a, b+1, n}}{b. 1, n- 1}]:Print["The integers are, v]: Print["Their number is .c] O Statement1: c=0; statement2: (Prime[GCD[a,b]]); statement3: {a,b); statement4: C=C+1 Statement1: c=0; statement2: (!PrimeQ[GCD[a, b]]); statement3: {a,b); statement4: C=C+1 Statement1: c=0; statement2: (PrimeQ[GCD[a,b]]); statement3: {a,b); statement4: C=C+1 O None of these