compiler design

 i want to solve this question ->

Draw  the control flow graph and identify the back edges, list the nodes in its natural loop for following intermediate representation code.

(l) A :read a, b. c, d, e, f, g

(2) B:a=b+c

(3) C:D=f *g

(4) E:C=.d-a 

(5) if a < c goto G

(6) F:e=e+b

(7) goto C

(8) G: if (b==f) goto I

(9) H:f =5 *d

(10) if (fc = a) goto H



(13) if (c > d) go to E

(14)D:if(d<=a) goto B

(15) Print a, b, c, d, e, f, g