Total 130 points CS 320: Test 3 11/29/18 Name:Kendra Clour lover Pl) Given B-tree with t - 3, Insert keys in the sequence of "H", "W","I and "M. You should show all steps for each key insertion (30 points) Mi As a function of the minimum degree t, what is the maximum number of keys that can be stored in a B-tree of height h? In order to receive the full credit, your detail explanation is required. P2) Answer the following B-tree related questions (40 points). a) b) Then what is the minimum number of keys with the minimum degree