Consider the schema $$R = \left( {S\,\,T\,\,U\,\,V} \right)$$ and the dependencies $$S \to T,\,\,T \to U,\,\,U \to V$$ and $$V \to S$$ let $$R =$$ $$(R1$$ and $$R2)$$ be a decomposition such that $$R1 \cap R2 \ne \phi .$$ The decomposition is:

Which of the following is/are correct?

Consider the set of relations

EMP (Employee-no, Dept-no, Employee-name, Salary)
DEPT (Dept-no, Dept-name, Location)

Write an SQL query to:

(a) Find all employee names who work in departments located at "Calcutta" and whose salary is greater than Rs.50,000.

(b) Calculate, for each department number, the number of employees with a salary greater than Rs.1,00,000.

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are