Find algorithms to perform the following relational operations on the ordered BDD's that represent them:  a) Project out some of the boolean variables. That is, the function represented should be true...

Find algorithms to perform the following relational operations on the ordered BDD's that represent them:

a) Project out some of the boolean variables. That is, the function represented should be true for a given truth assignment a if there was any truth assignment for the missing variables that, together with a made the original function true.

b) Join two relations r and s, by combining a tuple from r with one from s whenever these tuples agree on the attributes that r and s have in common. It is really sufficient to consider the case where the relations have only two components, and one from each relation matches; that is, the relations are r(A,B) and s(B, C).