Part $2$: Consider the following relations.

R$0$ R$1$ R$2$

A B A B

$1111$

$2123$

$22$

$32$

$33$

$3.$ For each relational algebra expression, draw a table with the resultant

relation and write an equivalent expression in tuple relational calculus.

a$)$ R$0\backslash$cup $($R$1\backslash$times R$2)$

b$)\backslash$sigma A$=$B$($R$0)$

$4.$ For the following tuple relational calculus expression, draw a table with

the resultant relation and write an equivalent relational algebra expression.

$($R$.$A$|$R$0($R$)($S$)($R$1($S$)$ R$.$A $=$ S$.$A$)$

Bonus Question: Explain why the database is referenced during query optimization $($step $2$ of query processing$).$Part $2$: Consider the following relations.

For each relational algebra expression, draw a table with the resultant

relation and write an equivalent expression in tuple relational calculus.

a$)R0(R1R2)$

b$){}_A=B(R0)$

For the following tuple relational calculus expression, draw a table with

the resultant relation and write an equivalent relational algebra expression.

Bonus Question: Explain why the database is referenced during query opti$-$

mization $($step $2$ of query processing$).$