Question points$]$ For each statement indicate true $($T$)$ or false $($F$)$ without Each statement is worth $1\mathrm{.}5$ points. Statements on Binary Decision Diagrams Every variable node in a Binary Decision Diagram has two outgoing edges and one incoming edge. The THEN edges of two variable nodes in a Binary Decision diagram may point to the same variable node. The number of variable nodes at a level of a Binary Decision Diagram increases as the distance of the level from the root node increases. Consider a binary function F stored in a Binary Decision Diagram. Any two paths from the root node to terminal $1$ represent disjoint sets of fully specified product terms in the on$-$set of F$.$ The Binary Decision Diagram for the AND function AND $($a$,$b$)$ has two variable node labeled A