A employee database is defined by the following relations: employee = (employee name, city, street) work = (employee_ name, company_name, salary) company = (company_name, city) manages = (employee_name, manage_name) (The primary keys are underlined.) The following SQL statement select company-name from works group by company-name having count (distinct employee-name) >= all (select count (distinct employee-name) from works group by company-name) provides the company that has the most employees higher salary employees some employees a few employees lowest salary empolees An employee database is defined by the following relations (the primary keys are underlined): - employee = (employee name, city, street) - works = (employee_name, company_name, salary) - company = (company name, city) - manages = (employee_name, manage_name) What does the following SQL statement return? SELECT company-name FROM works GROUP BY company-name HAVING COUNT(DISTINCT employee-name) >=ALL (SELECT COUNT(DISTINCT employee-name) FROM works GROUP BY company-name) the name of the company with the most employees the name of the company with higher salary employees a list of company names in order of number of employees a list of employees grouped by company name a list of company names with more than one employee A relation containing one or more repeating groups will be in which Normal Form? Such a relation is Un-normalised Boyce-Codd Normal Form (BCNF) Fourth Normal Form (4NF) First Normal Form (1NF) Second Normal Form (2NF) Calculate the relational algebra expression RS given relations R and S below. (Relation S) (Relation R) {} {,} {,,} {,} {} Considering the two tables S(A,B,C) and R(A,B,C) below, what is the result set of SX R ? Where X is the cartesian product operator. 3. {,,,} 2. {} 1. {,} 4. {,,} 5. {b,g,a>,,]