Consider a hash table with 10 positions and hash function: h1(k)= 2K+3 and h2(k)=3k+1? Keys are inserted in the following order: 3,4,8,7,6,5,11,10 also draw the resulting array?

(a) Use Division method

(b) Use hashing with Quadratic Probing

(c) Use hashing with Double Probing

(d) Specify the no of position probed for each key

(e) Specify the order of values in hash table

Note: This Question is for Data Structures course being studied in C++