Consider a hash table of size 7 with hash function h(k) = A: mod 7. Draw the hash table after inserting in it. in the given order, the following values into the table: 14, 28, 2, 26, and 70: when linear probing is used to resolve collisions when double hashing with secondary hash function h'(k) = 5 - (k mod 5) is used to resolve collisions. Consider the following binary search tree. Insert the keys 15 and 10 (in that order) into the tree and show the resulting tree. You must use the algorithms described in class for inserting data into a binary search tree