3. We have a distribution P over the variables A,B,C,D,E, and G. We would like to build a Bayesian network that is a minimal I-Map for P. In reality, you have access to P, which you can query for independencies, but for the purposes of this problem, we will assume the following structure is a P-Map for P. Create minimal I-Maps for P, using the following variable orders. a. C,A,B,E,D,G b. D,B,A,E,C,G c. G,E,D,C,B,A d. G,A,C,E,D,B