When implementing an RE$.$A diagram in a relational database, a table is created for each many$-$to$-$many $($M:M$)$ relationship, and the table has a$($n$)$

$-$ which consists of two attributes that represent the

primary keys of each entity linked in that relationship.

a$.$ foreign key

b$.$ concatenated $($or composite primary key

c$.$ transitive dependency

d$.$ repeating group

e$.$ candidate key