\item For the following binary decision diagram:


\begin{center}
\begin{forest}
for tree={circle, draw, no edge,
          minimum size=2em,
          inner sep=0pt,
          s sep=10mm,
          l sep=5mm}
[$f$, rectangle, draw,  tikz={\draw [line] () to (a.north);}
   [$a$, name=a, tikz={\draw [line] () to (b1.north); \draw [fulldot=.5] () to (c2.north);}
      [$b$, name=b1, tikz={\draw [line, bend right] () to (c1.north west); \draw [dot=.5, bend left] () to (c1.north east);}
         [$c$, name=c1, tikz={\draw [line] () to (254:4.6); \draw [fulldot=.5] () to (265:4.42);}]
      ]
      [$c$, name=c2, tikz={\draw [line] () to (277:3.35); \draw [fulldot=.5] () to (291:3.53);}]
   ]
]
\end{forest}
\end{center}


Check if the following models are satisfying:
\begin{align*}
  \Model_1 =~&\{a = \top, b = \top, c = \bot\},\\
  \Model_2 =~&\{a = \bot, b = \bot, c = \bot\},\text{~and~}
\end{align*}
compute \DNF{f}.
