Given two relations R1 and R2, where R1 contains N1 tuples, R2 contains N2 tuples, and N2>N1>0, give the minimum and maximum possible sizes (in tuples) for the resulting relation produced by each of the following relational algebra expressions. In each case, state assumptions about the schema for R1 and R2 needed to make the expression meaningful: 1. R1R2; 2. R1R2 3. a=5(R1 4. a(R1)