For the following dependencies find the candidate keys. A={ P,Q,R,S,T } P->QR , Q->S , RS->T, R->S Is the following decomposition a lossless join? 1. R1 = {P,Q,R}, R2 ={P,S,T} 2. R1={P,Q,R} R2={R,S,T}

Relational Schema A = {P,Q,R,S,T}

The Functional Dependencies =

$P → QR$

$Q → S$

$RS → T$

$R → S$

The Decomposition of Relation A =

1] R1 = {P, Q, R}, R2 = {P, S, T}

2] R1 = {P, Q, R}, R2 = {R, S, T}

Candidate …