![3. Consider the following boolean formulas. Compute their unique reduced OBDDs with respect to the ordering [x, y, 2]. It is](https://media.cheggcdn.com/media%2F108%2F10843898-e049-4183-833c-de3595f8e0db%2Fphp90B5af.png)
3. Consider the following boolean formulas. Compute their unique reduced OBDDs with respect to the ordering [x, y, 2]. It is advisable to first compute a binary decision tree and then to perform the removal of redundancies (a) f(x,y)=x-y def def * (b) f(x,y)= x + y def (c) f(x,y)=x田y % Fe.va) leep) ) def * (d) f(x, y, z)竺(z田y)·(2 + 2) Show transcribed image text 3. Consider the following boolean formulas. Compute their unique reduced
OR
OR