Consider the relation schema R={A, B, C, D, E} and the following set of FDs:

A B

AB CD

CE A

BD A

1. Find all candidate keys in R and count the number of superkeys in R. Justify your answer (i.e., include the main steps used for finding all candidate keys and counting the number of superkeys).

2. What is a minimal cover of ? Justify your answer (i.e., include the main steps used for finding a minimal cover).