moralized graph :

Triangulated graph :

Consider the following distribution pla, b, c, d, e,f) -p(ap(bla)p(cbip(d c)p(ed)p(f a, e) a) After moralization and triangulation of this Bayesian network property b) Write the initial potential of each clique c) Describe an appropriate message updating schedule d) Show that the distribution can be expressed in the form: draw its clique tree and verify that it satisfies the running intersection p(alf)p(ba, c)p(ca, d)p(da, e)p(ela, f)p(f) Consider the following distribution pla, b, c, d, e,f) -p(ap(bla)p(cbip(d c)p(ed)p(f a, e) a) After moralization and triangulation of this Bayesian network property b) Write the initial potential of each clique c) Describe an appropriate message updating schedule d) Show that the distribution can be expressed in the form: draw its clique tree and verify that it satisfies the running intersection p(alf)p(ba, c)p(ca, d)p(da, e)p(ela, f)p(f)