**[3 P]** Consider the following distribution
^{4}

- a)
- Draw the Bayesian network for this distribution.
- b)
- Draw the moralised graph.
- c)
- Draw the triangulated graph. Your triangulated should contain cliques of the smallest size possible.
- d)
- Draw a junction tree for the above graph and verify that it satisfies the running intersection property.
- e)
- Write down a suitable initialization of clique potentials.
- f)
- Find an appropriate message updating schedule.

Hubner Florian 2014-01-21