1. (10 p) Using the two different methods below, insert the given values to the hash table that can contain at most 10 elements. For this question, simply fill in the table below. (a) Linear Probing Hash function: h(k)=k mod 10 (b) Quadratic Probing Hash function: h(k, i) = [h'(k)+c1*i + c2*i?] mod 10 (h'= k mod 10, c=3, c2=1) 35, 46, 45, 50, 26, 12, 55, 17, 7 (a) (b) 0 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 2. (15 p) Insert the following integer keys into a red-black tree. Show the red-black tree after each insertion that cause change in the tree. 24, 18, 43, 57, 90, 35, 60