probabilistic graphical models. data science.

Let A and B be two binary random variables whose minimal I-map consists of only the vertices corresponding to the variables A and B without any edges. Let C=Bc, i.e when B=0,C=1 and when B=1,C=0. Draw the minimal I-map Markov network for the variables A and C, and the minimal I-map Markov network for B and C. Give a proper mathematical justification for your diagrams. [6 Marks]