Consider a database with the following schema: – drinker (<u>name</u>, address) – bar (<u>name</u>, address) – beer (<u>name</u>, brewer) – frequents (<u>drin…
Consider a database with the following schema: – drinker (name, address) – bar (name, address) – beer (name, brewer) – frequents (drinker, bar, times_a_week) – likes (drinker, beer) – serves (bar, beer, price). 7. For each beer that Eve likes, find the names of bars that serve it at the lowest price. Format your output as a list of (beer, bar) pairs. (when a bar serves multiple beers at the same lowest price, they should all be included in the output) (hint: recall the “trickier exercise” in the slides for how to present “the lowest”)markdownCopy code/* input your answer in this cell: */
8. Find names of all drinkers who do not frequent any bar that serves some beers they like (drinkers who don’t frequent any bar should not be included).
OR