Hello Chegg, Looking for an answer for this question, Sorry its a bit long. Thank you very much!

1. Consider a database with the following schema: Person (name, age, gender) Frequents (name, iceCreamShop) (name, ice cream shop) is a key Eats (name, flavor) Sells (iceCreamShop, flavor, price) iceCreamShop, flavor) is a key name is a key (name, flavor) is a key Using relational algebra: a) Find all the ice cream shops frequented by males over 21 years old. b) Find all the names of females that eat vanilla ice cream but not chocolate. c) Find all the names of males that eat either strawberry or/and pistachio ice cream. d) Find all the ice cream shops where Sam likes at least one of their flavors and each cost less than $5. For each person, find all ice cream flavors the person eats that are not served by any ice cream shop the person frequents. Return the name of the person and the ice cream flavor in pairs. Find an ice cream shop that is frequented by people older than 30 but younger than 40 years old. Find all the names of females that frequent every ice cream shop serving at least one flavor they eat. Find the ice cream shop with the most expensive scoop of vanilla ice cream, if there's more than one return all that apply. Find the names of all people who frequent only ice cream shops serving at least one flavor they like e) f) g) h) i)