Logical Conjunction of Binary Decision Diagrams Compute a Binary Decision Diagram for $B1∧B2$. Furthermore, for an arbitrary BDD B you can use the equations $B∧F=F$, $F∧B=F$, $B∧T=B$ and $T∧B=B$.


To construct the BDD i start from the leaves and work myself to the top. So i have:

but here is the problem: 

Now i do not know how to proceed from here on. Has someone experience with Binary Decision Diagrams ? I would like to understand this problem and solve it.

This is the solution step by step :

