Consider a relation with schema r(a, b, c, d, e) and fd’s ab → c, c → d, d → b, d → e
1. indicate all bcnf violations. do not forget to consider fd's that are not in the given set, but follow from them. only give violations that have a single attribute on the right side.
2. decompose the relation into a collection of relations in bcnf.
3. indicate 3nf violations.
4. decompose the relation into a collection of relations in 3nf.

yes

yes yes yes

step-by-step explanation:

you divide the denominator by the numerator on both sides and if the quotients are equal then the fractions are equivalent

let x be the money she spent so that she can earn the free t-shirt.

since, she already spent $112.49

⇒

also, as per the statement: jennifer must spend $250 or more in order to qualify for a free t-shirt at the store.

then,

we have an inequality i.,e

subtract 112.49 from both sides we get;

therefore, $137. 51 more money does jennifer need to spend so that she can earn the free t-shirt

in the attachment.   i didn't see your choices.   the word which means there is choices.

step-by-step explanation:

(x,y)

x tells you how much left or right you go from the origin

y tells you how much down or up you go from the origin

so for example (-3,2), you go left 3 and up twice. i denoted which of the ordered pairs is which in my graph.