Given the set of SS-tables in LSM.And the hash functions H1(…

Given the set of SS-tables in LSM.And the hash functions H1(v), and H2(v) where v is a index key value as: H1(Alice) = 5                                           H2(Alice) = 0 H1(Billy) = 3                                            H2(Billy) = 0 H1(Doug) = 5                                          H2(Doug) = 1 H1(Frank) = 4                                          H2(Frank) = 3 H1(Cathy) = 2                                          H2(Cathy) = 3 H1(Eric) = 2                                             H2(Eric) = 5 H1(Henry) = 3                                         H2(Henry) = 4 H1(Ian) = 1                                              H2(Ian) = 2 The false positive will be occurred when searching which index key value(s)?   

Create the B-Tree index structure(m=3) after insert the foll…

Create the B-Tree index structure(m=3) after insert the following input indexes:                         3, 6, 2, 9, 3, 6, 2, 7, 9, 1, 4, 6, 3.     Note. Please show each steps, not only the final answer.     (Please upload file to answer the question.)

According to the following B-tree, if we delete index all 2s…

According to the following B-tree, if we delete index all 2s and all 5s, what is the B-Tree index data structure(m=4) after the deletions?                             Note. Please show each step, not only the final answer.                     (Please upload file to answer the question.)