Instructions Draw a data flow graph (DFG) for the Java method isRelativelyPrime() given below. Also give as tables: i) Def0) and c-use) for all variables ii) Predicates and p-use) for the edges of the data fow graph. (Use Tables 5.1 and 5.2 of textbook pages 120 and 121 as guide) 1 boolean isRelativelyPrime (int e, int m) 2 3 4 // first find greatest common divisor (gcd) int t e; int gede; boolean rpfalse; while (m 0) te e m 10 12 13 14 15 16 17 // e and m relatively prime if ged is 1 if (gcd# 1) rptrue; else 19 20 21 rp false ; return rp; Instructions Draw a data flow graph (DFG) for the Java method isRelativelyPrime() given below. Also give as tables: i) Def0) and c-use) for all variables ii) Predicates and p-use) for the edges of the data fow graph. (Use Tables 5.1 and 5.2 of textbook pages 120 and 121 as guide) 1 boolean isRelativelyPrime (int e, int m) 2 3 4 // first find greatest common divisor (gcd) int t e; int gede; boolean rpfalse; while (m 0) te e m 10 12 13 14 15 16 17 // e and m relatively prime if ged is 1 if (gcd# 1) rptrue; else 19 20 21 rp false ; return rp