Which of the following relational query languages have the same expressive power?

I) Relational algebra
II) Tuple relational calculus restricted to safe expressions
III) Domain relational calculus restricted to safe expressions

Let r be a relation instance with schema R = (A, B, C, D).

We define $${r_1} = {\pi _{A,B,C}}\left( r \right)$$ and $${r_1} = {\pi _{A,D}}\left( r \right)$$. Let $$s = {r_1}*{r_2}$$ where * denotes natural join. Given that the decomposition of r into r₁ and r₂ is lossy, which one of the following is TRUE?

Let R₁ (A, B, C) and R₂ (D, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R₁ referring to R₂. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r₁ and r₂. Which one of the following relational algebra expressions would necessarily produce an empty relation?

Consider the following SQL query:

Select distinct a1, a2, ..., an 

From r1, r2, ..., rm 

Where P; 

For an arbitrary predicate P, this query is equivalent to which of the following relational algebra expressions?