c & d

5.8: Suppose we have a database consisting of the following three relations FREQUENTS(DRINKER, BAR) SERVES(BAR, BEER) LIKES(DRINKER, BEER) The first indicates the bars each drinker visits, the second tells what beers each bar serves, and the last indicates which beers each drinker likes to drink. Express in (i) relational algebra (ii) tuple calculus (ii) domain calculus a) b) Print the bars that serve a beer that drinker Charles Chugamug likes. Print the drinkers that frequent at least one bar that serves a beer they like. Print the drinkers that frequent only bars that serve some beer that they like. (Assume each drinker likes at least one beer and frequents at least one bar.) Print the drinkers that frequent no bar that serves a beer that they like *c) *d)