This question concerns the distribution

p(a,b,c,d,e,f,g,h,i) = p(a)p(b|a)p(c|a)p(d|a)p(e|b)p(f|c)p(g|d)p(h|e,f)p(i|f,g)

a) Draw the Belief Network for this distribution.

b) Draw the moralized graph.

c) Draw the triangulated graph. Your triangulated graph should contain cliques of

the smallest size possible.

d) Draw a junction (clique) tree for the above graph and verify that it satisfies the

running intersection property.

e) Describe a suitable initialization of clique potentials.

f) Describe the Absorption procedure and an appropriate message updating

schedule.