An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements.
S1: A hash index must be a dense index
S2: A B+ tree index can be a sparse index
Which one of the following options is correct?
- ABoth S1 and S2 are true
- BBoth S1 and S2 are false
- CS1 is true and S2 is false
- DS1 is false and S2 is true

