Suppose you are given a relation r(a, b,c, d). for each of the following sets of fds, assuming they are the only dependencies that hold for r, do the following: (a) identify the candidate key(s) for r. (b) state whether or not the proposed decomposition of r into smaller relations is a good decomposition and briefly explain why or why not.

it would be 6xy and -16xy.

false

step-by-step explanation:

false : it can not go to 9 the highest that part can go is 7

here is your proof

none of these

step-by-step explanation:

23 + 34 add up to 57 so just inform the teacher of this really stupid mistake

income. 10x+1300

expenses 3x+(1800+1500)

expenses 3x+3300

to break even:

income = expense,

10x + 1300 = 3x + 3300,

solve for x.

step-by-step explanation:

mark brainliest