Problem 4 Clique Trees in BN This question concerns the distribution p(a,b,c,d,e,f,g,h,i)=p(a)p(ba)p(ca)p(da)p(eb)p(fc)p(gd)p(he,f)p(if,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.

Most of answers are wrong. Please start from this Belief Network and provide the solutions for the rest.