Concepts:
Any superset of a key (primary key or candidate key) is a superkey.
Data:
n → total number of attributes = 4
n(s) → total number of super keys
In R(E, F, G, H) E is a primary key. Therefore, it must be included in every superkey.
F, G, H may or may not included in superkey.
Formula:
Since only one superkey is present in the relation:
n(S) = 2n -1
Calculation:
n(S) = 24-1 = 23 = 8
Superkeys are: E, EF, EG, EH, EFG, EFH, EGH, EFGH