$8-$ For the undirected graph on the square lattice as shown, use the variable elimination algorithm and obtain a clique tree representing this Markov network with smallest possible maximal cliques $($try to use an elimination order that generates less number of fill edges$).$ Write down the variable elimination steps. Draw a triangulated graph with the smallest clique sizes possible. $(10$ points$)$