1 - Suppose we have a database consisting of the following three relations SWIMMER(SSN, SNAME, LEVEL) BEACH(B#, BNAME, STATE, POLLUTION) SWIMMING(SSN. B#, DATE, DURATION) The first relation (SWIMMER) indicates the swimmers and their level (beginner, intermediate, advanced), the second (BEACH) indicates different beaches across the country. Each beach has a number (B#) a name (BNAME) and a pollution rate of O (low pollution), 1 (moderate pollution), or 2 (high pollution). The third (SWIMMING) records the members swimming. (Relational Algebra symbols: (SIGMA), 7 (PROJECT). U (UNION), (INTERSECTION). (-) MINUS, M (JOIN) If you cannot copy-paste, simply type SIGMA, PROJECT, JOIN, etc.) N Express the following queries in (i) relational algebra and (1) SQL. 1. List the names of beaches that John Smith has visited? 2. List the names of swimmers who visited at least one beach to which John Smith has also been. 3. List the names of swimmers who visited only beaches to which John Smith has visited. 4. List the names of swimmers who visited no beach to which John Smith has been 5. List the names of the swimmers who visited all the beaches to which John Smith has been